#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int n;
int a[110],dp[110][100100],ans;
bool cmp(int q,int w){
	return q>w;
}
int main()
{
	cin>>n;int s=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		s+=a[i];
	}
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++)	dp[i][a[i]]=1;
	for(int i=1;i<=n-1;i++){
		for(int j=1;j<=s;j++){
			if(dp[i][j]){
				dp[i+1][j+a[i+1]]=1;
				dp[i+1][j]=1;
				if(j-a[i+1]>0){
					dp[i+1][j-a[i+1]]=1;
				}	
			}
		}
	}
	for(int i=1;i<=s;i++){
		if(dp[n][i]){
			ans++;
		}		
	}
	cout<<ans;
}