#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

const int MAXN=25;

int ans=0,n,m,i,j,k,p1,p2,p3,p4,len[MAXN];

int cha(int s,int e)
{
	int i,l=0;
	i=s;
	while (i!=e)
	{
		l+=len[i];
		++i;
		if (i>n) i=1;
	}
	return l;
}

int main()
{
	freopen("fly.in","r",stdin);
	freopen("fly.out","w",stdout);
	scanf("%d",&n);
	for (i=1;i<=n;i++)
		scanf("%d",&len[i]);
	for (p1=1;p1<=n;p1++)
		for (p2=p1+1;p2<=n;p2++)
			for (p3=p2+1;p3<=n ;p3++)
				for (p4=p3+1;p4<=n;p4++)
				{
					if (cha(p1,p2)==cha(p3,p4) && cha(p2,p3)==cha(p4,p1))
					{
						ans++;
					}
				}
	printf("%d\n",ans);
	return 0;
}