#include<cstdio>
#include<vector>
#include<unordered_map>
#define N 20
#define ll long long
using namespace std;
int n,m,t[N],a[N],cnt,ans;
vector<int>v[1<<N];
unordered_map<int,int>mp; 
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
int main(){
    freopen("subsets.in","r",stdin);freopen("subsets.out","w",stdout);
    t[0]=1;for(int i=1;i<N;i++)t[i]=t[i-1]<<1;
    m=1<<(n=read());
    for(int i=0;i<n;i++)a[i]=read();
    for(int s=1;s<m;s++)
    {
        int sum=0,x,y;
        for(int i=0;i<n;i++)
            if(s&t[i])
                sum+=a[i];
        v[mp[sum]?mp[sum]:mp[sum]=cnt++].push_back(s);
        if(sum&1)continue;
        sum>>=1;x=mp[sum];y=v[x].size();
        if(!x)continue;
        for(int i=0;i<y;i++)
            if((s|v[x][i])==s)
            {
                ans++;break;
            }
    }
    printf("%d",ans);
    return 0;
}