# include<iostream>

# include<cstdio>

# include<cmath>

# include<algorithm>

# include<cstring>

using std::sort;

const int mn = ;

int a[mn];

int n;

struct node{int val,cur;};

node L[<<mn],R[<<mn];

int vis[<<mn];

int LeftCnt,RightCnt;

void dfs(int x,int en,int nowval,int nowstate)

{

    if(x>en)

    {

        if(en==n/)    L[++LeftCnt].val=nowval,L[LeftCnt].cur=nowstate;

        else R[++RightCnt].val=nowval,R[RightCnt].cur=nowstate;

        return ;

    }

    dfs(x+,en,nowval,nowstate);

    dfs(x+,en,nowval-a[x],nowstate+(<<(x-)));

    dfs(x+,en,nowval+a[x],nowstate+(<<(x-)));

}

bool cmp1(node x,node y){return x.val<y.val;}

bool cmp2(node x,node y){return x.val>y.val;}

int main()

{

    scanf("%d",&n);

    for(int i=;i<=n;i++)

        scanf("%d",&a[i]);

    dfs(,n/,,);

    dfs(n/+,n,,);

    sort(L+,L++LeftCnt,cmp1);

    sort(R+,R++RightCnt,cmp2);

    int l=,r=,ans=;

    while(l<=LeftCnt && r<=RightCnt)

    {

          while(L[l].val+R[r].val> && r<=RightCnt) r++;

          int pre=r;

          while(L[l].val+R[r].val== && r<=RightCnt)

          {

              if(vis[L[l].cur | R[r].cur]==)

                 vis[L[l].cur | R[r].cur]=,ans++;

              r++;

          }

          if(L[l].val==L[l+].val)     r=pre;

          l++;

    }

    printf("%d",ans-);

    return ;

}