#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<algorithm>#define mod (100005)using namespace std;int n,a[21],lim,t[21];bool vis[1<<21];int head[100005],size,ans=0;struct hash{    int tot,st,next;}edge[100005];void add_hash(int tot,int st){    int key=(tot%mod+mod)%mod;    size++;    edge[size].tot=tot;    edge[size].st=st;    edge[size].next=head[key];    head[key]=size;}void find_hash(int tot,int st){    int key=(tot%mod+mod)%mod;    for(int i=head[key];i!=-1;i=edge[i].next)if(edge[i].tot==tot)vis[edge[i].st+st]=1;}void dfs1(int k,int tot,int st){    if(k>lim)    {        add_hash(tot,st);        return;    }    dfs1(k+1,tot,st);    dfs1(k+1,tot+a[k],st+t[k]);    dfs1(k+1,tot-a[k],st+t[k]);}void dfs2(int k,int tot,int st){    if(k==lim)    {        find_hash(tot,st);        return;    }    dfs2(k-1,tot,st);    dfs2(k-1,tot+a[k],st+t[k]);    dfs2(k-1,tot-a[k],st+t[k]);}int main(){    freopen("regex.in","r",stdin);    freopen("regex.out","w",stdout);    memset(head,-1,sizeof(head));    int i,j;    scanf("%d",&n);lim=n/2;    for(i=1;i<=n;i++)scanf("%d",&a[i]),t[i]=1<<(i-1);    dfs1(1,0,0);    dfs2(n,0,0);    int cnt=(1<<21)-1;    for(i=1;i<=cnt;i++)        ans+=vis[i];    printf("%d\n",ans);    return 0;}