#include<bits/stdc++.h>
using namespace std;

void solve(int t){
    int n;
    cin>>n;
    
    const int bit = 40, bound = 20;
    vector<long long> v(bit,0);
    bool zero=false;
    for(int i=0;i<n;i++){
        long long a;
        cin>>a;
        if(a==0)zero=true;
        for(int j=0;j<bit;j++){
            if((1ll<<j)&a){
                if(v[j]==0)v[j]=a;
                else v[j]&=a;
            }
        }
    }
    
    for(int i=0;i<bit;i++){
        for(int j=i+1;j<bit;j++){
            if(v[j]==v[i])v[j]=0;
        }
    }
    
    vector grafo(bound,vector<int>());
    for(int i=0;i<bound;i++){
        for(int j=i+1;j<bound;j++){
            if(v[i]!=0 && v[j]!=0){
                if((v[j]&v[i])==v[j]){
                    grafo[i].push_back(j);
                }
                if((v[j]&v[i])==v[i]){
                    grafo[j].push_back(i);
                }
            }
        }
    }
    
    vector<int> ord;
    vector vis(bound,false);
    
    auto dfs = [&](auto &dfs,int nodo){
        if(vis[nodo])return;
        vis[nodo]=true;
        for(auto i : grafo[nodo]){
            dfs(dfs,i);
        }
        ord.push_back(nodo);
    };
    
    for(int i=0;i<bound;i++){
        if(v[i]!=0 && vis[i]==false)dfs(dfs,i);
    }
    reverse(ord.begin(),ord.end());
    
    vector dp(ord.size(),vector(1<<bound,-1ll));
    auto f = [&](auto &f,int pos,int mask)->long long{
        if(pos==ord.size())return 1ll;
        if(dp[pos][mask]!=-1)return dp[pos][mask];
        
        long long res=0;
        res+=f(f,pos+1,mask);
        if((mask&(1<<ord[pos]))==0){
            res+=f(f,pos+1,mask|v[ord[pos]]);
        }
        return dp[pos][mask]=res;
    };
    
    long long ans=0;
    for(int mask = 0; mask<(1ll<<(bit-bound)); mask++){
        bool ok = true;
        long long rim = 0;
        
        for(int i=0;i<(bit-bound);i++){
            if(mask&(1ll<<i)){
                rim|=(v[bound+i]&((1ll<<bound)-1));
                if(v[bound+i]==0)ok=false;
                break;
            }
            
            for(int j=0;j<i;j++){
                if(mask&(1ll<<j)){
                    assert(v[bound+j]!=0);
                    if((v[bound+i]&v[bound+j])==v[bound+i] || (v[bound+i]&v[bound+j])==v[bound+j]){
                        ok=false;
                        break;
                    }
                }
            }
            if(!ok)break;
        }
        
        if(ok){
            ans+=f(f,0,rim);
        }
    }
    
    ans-=!zero;
    cout<<ans<<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)solve(i);
    
    return 0;
}