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

#define forn(i,n) for (int i=0; i<(n); i++)
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define f first
#define s second

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;

template<typename A, typename B> ostream& operator<<(ostream & cout, pair<A,B> const &p) {
    return cout << "("<< p.f << ", "<< p.s << ")";
}
template<typename A> ostream& operator<<(ostream &cout, vector<A> const & v) {
    cout << "[";
    forn(i, v.size()) {
        if(i) cout << ", ";
        cout << v[i];
    }
    return cout << "]";
}

typedef vector<int> vi;
#define all(x) begin(x), end(x)
#define rep(i, a, b) for(int i=a; i<(b); ++i)
#define sz(x) x.size()

vi val, comp, z, cont;
int Time, ncomps;
template<class G, class F> int dfs(int j, G& g, F& f) {
    int low = val[j] = ++Time, x; z.push_back(j);
    for(auto e: g[j]) if(comp[e] < 0)
        low = min(low, val[e] ?: dfs(e,g,f));
    if(low == val[j]) {
        do {
            x = z.back(); z.pop_back();
            comp[x] = ncomps;
            cont.push_back(x);
        } while(x != j);
        f(cont); cont.clear();
        ncomps++;
    }
    return val[j] = low;
}
template<class G, class F> void scc(G& g, F f) {
    int n = sz(g);
    val.assign(n, 0); comp.assign(n, -1);
    Time = ncomps = 0;
    rep(i, 0, n) if (comp[i] < 0) dfs(i, g, f);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;

    const int LG = 40;

    vector<ll> a(n);

    vector<vector<bool>> adj_mat(LG, vector<bool>(LG, true));
    vector<bool> present(LG);

    ll andofall = (1LL<<LG)-1;

    forn(i, n) {
        cin >> a[i];
        andofall &= a[i];
        forn(j, LG) {
            if((a[i]>>j)&1) present[j] = true;
            forn(k, LG) {
                if(((a[i]>>j)&1)==1 && ((a[i]>>k)&1) == 0) {
                    adj_mat[j][k] = 0;
                }
            }
        }
    }

    // cout << adj_mat << "\n";

    vector<int> trans(LG);
    int cnt = 0;
    forn(i, LG) {
        trans[i] = cnt;
        cnt += present[i];
    }
    vector<vector<int>> g(cnt);

    forn(i, LG) {
        if(!present[i]) continue;
        forn(j, LG) {
            if(!present[j] || i == j) continue;
            if(adj_mat[i][j]) g[trans[i]].pb(trans[j]);
        }
    }
    // cout << g << "\n";


    scc(g, [&](vi& v){});


    int N = ncomps;
    int K = min(26, N);
    int L = N - K;
    vector<ll> basis(N, 0);
    forn(i, N) basis[i] |= (1LL << i);
    // cout << N << " " << K << " " << L << endl;
    forn(i, cnt) {
        for(int x: g[i]) {
            basis[comp[i]] |= (1LL<<comp[x]);
        }
    }

    // cout << basis << endl;

    assert(L <= 14);
    vector<ll> s(1LL<<L), t(1LL<<L);

    vector<ll> cp(1LL<<K);
    for(int b=1; b<1LL<<K; b++) {
        ll last_bit = b&-b;
        int l = 63 - __builtin_clzll(last_bit);
        ll curr = cp[b - last_bit];
        curr |= basis[l+L];
        cp[b] = curr;

        // check if valid
        if((curr >> L) != b) {
            assert(((curr>>L)&b) == b);
        } else {
            s[curr & ((1LL<<L)-1)]++;
        }
    }
    s[0] += 1;

    t[0] = 1;
    vector<ll> cpt(1LL<<L);
    for(int b=1; b<1LL<<L; b++) {
        ll last_bit = b&-b;
        int l = 63 - __builtin_clzll(last_bit);
        ll curr = cpt[b - last_bit];
        curr |= basis[l];
        cpt[b] = curr;

        // check if valid
        if(curr != b) {
            assert(curr < (1LL<<L));
        } else {
            t[curr]++;
        }
    }

    // cout << s << " " << t << endl;
    ll ans = 0;
    forn(b, (1LL<<L)) {
        ans += s[0]*t[b];
        for(int x = b; x; ) { --x &= b;
            ans += s[b-x]*t[x];
        }
    }

    // check if 0 is allowed
    if(andofall > 0) ans--;

    cout << ans << "\n";

}