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

#define ff first
#define ss second
#define pb push_back

typedef long long ll;
typedef pair <int,int> pii;

const int N = 200'005;
const int LOGM = 40;
const ll INF = (1LL<<41)-1LL;
const int TOT_MASK = (1<<20)-1;

ll arr[N];
int n;

ll mask[LOGM];
bool banned[LOGM];
vector <int> g[LOGM];

void createGraph () {
    for ( int i = 0; i < LOGM; ++i )
        mask[i] = INF;
    for ( int i = 0; i < n; ++i )
        for ( int k = 0; k < LOGM; ++k )
            if ( (arr[i] >> k) & 1 )
                mask[k] &= arr[i];
    for ( int i = 0; i < LOGM; ++i ) {
        if ( mask[i] == INF )
            banned[i] = true;
        for ( int k = i+1; k < LOGM; ++k )
            if ( mask[i] == mask[k] )
                banned[k] = true;
    }
    for ( int i = 0; i < LOGM; ++i ) {
        if ( banned[i] ) continue;
        for ( int k = 0; k < LOGM; ++k ) {
            if ( i == k ) continue;
            if ( banned[k] ) continue;
            if ( (mask[i] & mask[k]) == mask[i] )
                g[i].pb ( k );
        }
    }
}


ll to_mask[LOGM];
ll dfs_toMask ( int node ) {
    assert ( node >= 0 and node < LOGM );
    ll &r = to_mask[node];
    if ( r != -1 ) return r;
    r = 0;
    for ( int it : g[node] )
        r |= (1LL<<it) | dfs_toMask ( it );
    return r;
}

void calcToMask () {
    memset ( to_mask, -1, sizeof to_mask );
    for ( int i = 0; i < LOGM; ++i ) {
        if ( banned[i] ) continue;
        dfs_toMask ( i );
    }
}

bool isBanned ( ll c_mask ) {
    assert ( c_mask >= 0 and c_mask < (1LL<<40) );
    ll check_mask = 0;
    for ( int i = 0; i < LOGM; ++i ) {
        if ( !((c_mask>>i)&1) ) continue;
        if ( banned[i] ) return true;
        check_mask |= to_mask[i];
    }
    return (check_mask & c_mask) != 0;
}

int memo[TOT_MASK+10];

ll calcAntiChain () {
    calcToMask ();
    for ( int mask = 0; mask <= TOT_MASK; ++mask ) {
        if ( isBanned ( mask ) ) continue;
        memo[mask] = 1;
    }
    for ( int k = 0; k < 20; ++k )
        for ( int mask = 0; mask <= TOT_MASK; ++mask ) 
            if ( (mask>>k)&1 )
                memo[mask] += memo[mask^(1<<k)];
    ll ans = 0;
    for ( ll mask = 0; mask <= TOT_MASK; ++mask ) {
        ll true_mask = mask << 20;
        if ( isBanned ( true_mask ) ) continue;
        ll check_mask = 0;
        for ( int i = 20; i < LOGM; ++i )
            if ( (true_mask>>i)&1 )
                check_mask |= to_mask[i];
        check_mask = TOT_MASK & (~check_mask);
        ans += memo[check_mask];
    }
    return ans;
}

int main () {
        
    #ifndef LOCAL
    #endif

    scanf ( "%d", &n );

    ll tot_and = (1LL<<LOGM)-1;
    for ( int i = 0; i < n; ++i ) {
        scanf ( "%lld", arr+i );
        tot_and &= arr[i];
    }

    createGraph ();

    printf ( "%lld\n", calcAntiChain () - (tot_and != 0) );

    return 0;
}