#include <iostream>
#include <vector>
#include <bitset>

using namespace std;

const int maxN = 200000, k = 40;
int n;
bitset <maxN> on[k];
bool useless[k], edge[k][k];
bool ok1[(1 << 20)], ok2[(1 << 20)];
long long sos[(1 << 20)], ans;
int ban[(1 << 20)];
vector <int> bits;


int main() {
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        long long x;
        cin >> x;
        for (int bit = 0; bit < k; bit++) {
            if (x & (1LL << bit)) {
                on[bit][x] = 1;
            }
        }
    }
    for (int bit1 = 0; bit1 < k; bit1++) {
        int sz = on[bit1].count();
        if (sz == 0 || sz == n) {
            useless[bit1] = 1;
        }
        if (useless[bit1]) {
            continue;
        }
        for (int bit2 = bit1 + 1; bit2 < k; bit2++) {
            if (on[bit1] == on[bit2]) {
                useless[bit2] = 1;
            }
        }
    }
    for (int bit = 0; bit < k; bit++) {
        if (!useless[bit]) {
            on[bits.size()] = on[bit];
            bits.push_back(bit);
        }
    }
    n = bits.size();
    for (int bit1 = 0; bit1 < n; bit1++) {
        for (int bit2 = bit1 + 1; bit2 < n; bit2++) {
            bitset <maxN> aux = (on[bit1] & on[bit2]);
            if (aux == on[bit1] || aux == on[bit2]) {
                edge[bit1][bit2] = 1;
                edge[bit2][bit1] = 1;
            }
        }
    }
    int n1 = n/2, n2 = n - n/2;
    ok1[0] = 1;
    ok2[0] = 1;
    sos[0] = 1;
    for (int mask = 1; mask < (1 << n1) || mask < (1 << n2); mask++) {
        int bit = 0;
        while ((mask & (1 << bit)) == 0) {
            bit++;
        }
        if ((mask < (1 << n1)) && ok1[mask ^ (1 << bit)]) {
            ok1[mask] = 1;
            for (int bit2 = bit + 1; bit2 < n1; bit2++) {
                if ((mask & (1 << bit2)) && edge[bit][bit2]) {
                    ok1[mask] = 0;
                    break;
                }
            }
        }
        if ((mask < (1 << n2)) && ok2[mask ^ (1 << bit)]) {
            ok2[mask] = 1;
            for (int bit2 = bit + 1; bit2 < n2; bit2++) {
                if ((mask & (1 << bit2)) && edge[n1 + bit][n1 + bit2]) {
                    ok2[mask] = 0;
                    break;
                }
            }
            sos[mask] = ok2[mask];
        }
    }
    for (int bit = 0; bit < n2; bit++) {
        for (int mask = 1; mask < (1 << n2); mask++) {
            if (mask & (1 << bit)) {
                sos[mask] += sos[mask ^ (1 << bit)];
            }
        }
    }
    for (int mask = 1; mask < (1 << n1); mask++) {
        int bit = 0;
        while ((mask & (1 << bit)) == 0) {
            bit++;
        }
        ban[mask] = ban[mask ^ (1 << bit)];
        for (int bit2 = 0; bit2 < n2; bit2++) {
            if (edge[bit][n1 + bit2]) {
                ban[mask] |= (1 << bit2);
            }
        }
    }
    int full = (1 << n2) - 1;
    for (int mask = 0; mask < (1 << n1); mask++) {
        if (!ok1[mask]) {
            continue;
        }
        ans += sos[full ^ ban[mask]];
    }
    cout << ans;
    return 0;
}