#include <iostream> 
using namespace std;
int n,m[25];
int a[25];
bool ch(int t,int k,long long s1,long long s2){
    if(t==k+1){
        if(s1==s2) return 1;
        return 0;
    }
    if(ch(t+1,k,s1+a[t],s2)) return 1;
    if(ch(t+1,k,s1,s2+a[t])) return 1;
    return 0;
}
long long ans=0;
void dfs(int t,int k,long long sum){
    if(t==n+1){
        if(k==0||(sum&1)) return;
        if(ch(1,k,0,0)) ans++;
        return;
    }
    a[k+1]=m[t];
    dfs(t+1,k+1,sum+m[t]);
    dfs(t+1,k,sum);
    return;
}
int main(){
    freopen("subsets.in","r",stdin);
    freopen("subsets.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>m[i];
    }
    dfs(1,0,0);
    cout<<ans;
    return 0;
}