CodeForces 617B-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 containexactly 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), where0 represents a piece without the nut and1 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

#include<iostream>
#include<cstdio>

using namespace std;

const int MAX_N=110;
int arr[MAX_N],arr1[MAX_N],n;
int t;
long long  ans=1;

int main(){
    int m=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&arr[i]);
    }
    for(int j=0;j<n;j++){
        if(arr[j]==1){
            arr1[m]=j;
            m++;
        }
    }
    if(m==1){printf("1\n");}
    else if(m==0){printf("0\n");}

    else{
        for(int k=m-1;k>0;k--){
        t=arr1[k]-arr1[k-1];
        ans*=t;
        }
    printf("%lld",ans);
    }
}

解题思路：找空隙分割。把相邻的1之间的空隙找到，再相乘。

当时写的错误：

1.m=0时结果是0不是1.

2.if语句不熟悉,eg:if..

                                else if...

                                else if...

                                else...

表示只会进行着四项中的一项

3.最后一个for循环k=m-1,写成了k=m

4.long long型的打印输出,scanf("ld",&s);printf("%ld",s);