#include<iostream>

 #include<string>

 #include<algorithm>

 #include<cstdlib>

 #include<cstdio>

 #include<set>

 #include<map>

 #include<vector>

 #include<cstring>

 #include<stack>

 #include<cmath>

 #include<queue>

 #include <bits/stdc++.h>

 using namespace std;

 #define INF 0x3f3f3f3f

 #define ll long long

 #define clc(a,b) memset(a,b,sizeof(a))

 const int maxn=;

 const int mod=1e9+;

 ll dp[];

 int n;

 int a[];

 int main()

 {

     while(~scanf("%d",&n))

     {

         clc(dp,);

         for(int i=;i<n;i++)

             cin>>a[i];

             dp[]=;

         for(int i=;i<=n;i++)

         {

             ll s=;

             for(int j=i-;j>=;j--)

             {

                 s+=a[j];

                 if(s==)

                     dp[i]+=dp[j];

             }

         }

         cout<<dp[n]<<endl;

     }

     return ;

 }