#include<cstdio>
#include<algorithm>
const int N=20,M=1<<10,E=59100;
int n,n0,i,j,k,a[N],g[M],v[E],nxt[E],ed,m,q[M],ce,ans;bool vis[1<<N];
struct P{int s,S;}e[E];
inline bool cmp(const P&a,const P&b){return a.s<b.s;}
void dfsl(int x,int s,int S){
  if(x==n0){v[++ed]=s;nxt[ed]=g[S];g[S]=ed;return;}
  dfsl(x+1,s,S);
  dfsl(x+1,s+a[x],S|(1<<x));
  dfsl(x+1,s-a[x],S|(1<<x));
}
void dfsr(int x,int s,int S){
  if(x==n){e[ce].s=s;e[ce++].S=S;return;}
  dfsr(x+1,s,S);
  dfsr(x+1,s+a[x],S|(1<<x));
  dfsr(x+1,s-a[x],S|(1<<x));
}
int main(){
  scanf("%d",&n);n0=(n+1)/2;
  for(i=0;i<n;i++)scanf("%d",&a[i]);
  dfsl(0,0,0),dfsr(n0,0,0);
  std::sort(e+1,e+ce+1,cmp);
  for(i=0;i<1<<n0;i++){
    for(m=0,j=g[i];j;j=nxt[j])q[m++]=v[j];
    std::sort(q,q+m);
    for(j=k=0;j<ce;j++){
      while(k<m&&q[k]<e[j].s)k++;
      if(k==m)break;
      if(q[k]==e[j].s)vis[i|e[j].S]=1;
    }
  }
  for(i=1;i<1<<n;i++)if(vis[i])ans++;
  return printf("%d",ans),0;
}