#include<bits/stdc++.h>
using namespace std;
int n,a[23],num;
bool vis[2097159];
map<int,int>mp;
vector<int> v[10000005];
void dfs1(int k,int res,int now){
    if(k==n/2+1){
        if(mp.find(res)==mp.end()) mp[res]=++num;
        int tmp=mp[res]; v[tmp].push_back(now);
        return ;
    }
    dfs1(k+1,res,now);
    dfs1(k+1,res+a[k],now|(1<<k-1));
    dfs1(k+1,res-a[k],now|(1<<k-1));
}
void dfs2(int k,int res,int now){
    if(k==n+1){
        if(mp.find(res)!=mp.end()){
            int tmp=mp[res];
            for(int i=0;i<v[tmp].size();i++) vis[v[tmp][i]|now]=1;
        }
        return;
    }
    dfs2(k+1,res,now);
    dfs2(k+1,res+a[k],now|(1<<k-1));
    dfs2(k+1,res-a[k],now|(1<<k-1));
}
int main(){
	freopen("subsets.in","r",stdin);
	freopen("subsets.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    dfs1(1,0,0); 
	dfs2(n/2+1,0,0);
	int ans=0;
    for(int i=1;i<=(1<<n)-1;i++) 
	ans+=vis[i];
    printf("%d",ans);
    return 0;
}