#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m[21],maxx;
ll ans;
map<int,int> mp;
void dfs(int dep,int s1,int s2,int num){
    if(s1>maxx/2||s2>maxx/2) return ;
    if(dep<=n){
        dfs(dep+1,s1,s2,num);
        dfs(dep+1,s1+m[dep],s2,num+(1<<dep));
        dfs(dep+1,s1,s2+m[dep],num+(1<<dep));
    }else if(s1==s2&&mp[num]==0){
        ans++;
        mp[num]=1;
    }
}
int main(){
    freopen("subsets.in","r",stdin);
    freopen("subsets.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>m[i];
        maxx+=m[i];
    }
    dfs(1,0,0,0);
    cout<<ans-1<<endl;
    return 0;
}