#include<cstdio>

 #include<algorithm>

 using namespace std;

 int n,a[],sum[],half,ans;

 int query(const int &A,const int &B)

 {

     int x=max(A,B),y=min(A,B),res=sum[x-]-sum[y-];

     if(res>half) return sum[n]-res;

     else return res;

 }

 int main()

 {

     scanf("%d",&n);

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

       {

           scanf("%d",&a[i]);

           sum[i]=sum[i-]+a[i];

       }

     half=sum[n]>>;

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

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

         for(int k=j+;k<=n;k++)

           for(int l=k+;l<=n;l++)

             if(query(i,j)==query(k,l)&&query(j,k)==query(l,i))

               ans++;

     printf("%d\n",ans);

     return ;

 }