.......

#include<bits/stdc++.h>
using namespace std;
int ans=0,sum=0,pos=1;
int n,a[10010];
bool vis[10010];
void dfs(int pos,int sum){
    if(pos>n){
        if(sum!=0&&vis[sum]==false){
            vis[sum]=true;
            ans++;
        }
        return;
    }
    dfs(pos****um);
    dfs(pos****um+a[pos]);
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    dfs(pos,sum);
    cout<<ans;
    return 0;
}