#include <cstdio>
#include <iostream>
#include <cstdlib>
using namespace std;
int N;
int Q[5];
int S[21]={0};
int C[21];
int ans=0;

void init()
{
	cin>>N;
	for(int i=1;i<=N;i++)
	{
		cin>>C[i];
		S[i]=S[i-1]+C[i];
	}
}

void dfs(int deep,int num)
{
	if(deep==5)
	{
		if((S[N]-Q[2]-Q[3]-Q[4])==Q[3] && Q[2]==Q[4])
			ans++;
		return; 
	}
	for (int i=num+1;i<=N;i++)
	{
		Q[deep]=S[i]-S[num];
		dfs(deep+1,i);
	}
}

int main()
{
	freopen("fly.in","r",stdin);
	freopen("fly.out","w",stdout);
	init();
	dfs(1,0);
	cout<<ans<<endl;
	return 0;
}