Chocolate

Bob loves everything sweet. His favorite chocolate bar consists of pieces, each piece may contain a nut. Bob wants to break the bar of chocolate into multiple pieces so that each part would contain exactly one nut and any break line goes between two adjacent pieces.

You are asked to calculate the number of ways he can do it. Two ways to break chocolate are considered distinct if one of them contains a break between some two adjacent pieces and the other one doesn't.

Please note, that if Bob doesn't make any breaks, all the bar will form one piece and it still has to have exactly one nut.

Input

The first line of the input contains integer n (1 ≤ n ≤ 100) — the number of pieces in the chocolate bar.

The second line contains n integers a_i (0 ≤ a_i ≤ 1), where 0 represents a piece without the nut and 1 stands for a piece with the nut.

Output

Print the number of ways to break the chocolate into multiple parts so that each part would contain exactly one nut.

Example

Input

3
0 1 0

Output

1

Input

5
1 0 1 0 1

Output

4

Note

In the first sample there is exactly one nut, so the number of ways equals 1 — Bob shouldn't make any breaks.

In the second sample you can break the bar in four ways:

10|10|1

1|010|1

10|1|01

1|01|01

题意：将字符串分段，要求每段字符串中必须含有1.输出将字符串分解成多段的方法。

思路：特殊情况，字符串中全是0，输出0.

否则，检查两个相邻的1之间一共有几个0.

例如1001，串里两个1之间一共2个0， 有|00、0|0、00|，这三种切割形式（机2+1种）

所以，两个相邻1之间0的个数N与划分种数的关系是N+1。

全部字符串的划分形式总合就是每个区间段上的划分种数的乘积。（数学的组合思想）

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
    int n,a[105],flag=0;
    long long sum=1;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
    }
    int begins=0,ends=n-1;
    while(begins<n)
    {
        if(a[begins]==1)
            break;
        begins++;
    }
    while(ends>=0)
    {
        if(a[ends]==1)
            break;
        ends--;
    }
    if(begins>=n)
        printf("0\n");
    else
    {
        int cnt=0;
        while(begins<ends)
        {
            begins++;
            if(a[begins]==0)
                cnt++;
            if(a[begins]==1)
            {
                sum*=(cnt+1);
                cnt=0;
            }
        }
        printf("%lld\n",sum);
    }
    return 0;
}