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

using vi = vector<int>;
using ll = long long;
using pii = pair<int, int>;
using vvi = vector<vi>;
using vll = vector<ll>;

#define rep(i, a, b) for(int i = a; i < (b); i++)
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define bitat(x, i) (((x)>>(i))&(1))

void solve() {
    int n;
    cin >> n;

    vector<ll> arr(40, 0);
    ll tot = (1ll<<40)-1;
    for (int i = 0; i < n; i++) {
        ll x;
        cin >> x;
        tot &= x;
        for (int j = 0; j < 40; j++) {
            if (bitat(x, j)) arr[j] = (arr[j] == 0 ? x : arr[j]&x);
        }
    }

    vll ways(1<<20);
    for (int i = 1; i < (1<<20); i++) {
        ways[i] = ways[i&(i-1)] | (arr[__builtin_ctz(i)]-(i&-i)) | ((!arr[__builtin_ctz(i)])*((1ll<<20)-1));
    }
    for (int i = 0; i < (1<<20); i++) {
        if (i&ways[i]) ways[i] = 0;
        else ways[i] = 1;
    }
    for (int bit = 1; bit < (1<<20); bit *= 2) {
        for (int i = 0; i < (1<<20); i++) {
            if ((i^bit) < i) ways[i] += ways[i^bit];
        }
    }
    vll ways2(1<<20);
    for (int i = 1; i < (1<<20); i++) {
        ways2[i] = ways2[i&(i-1)] | (arr[__builtin_ctz(i)+20]);
    }
    sort(all(ways2));
    ways2.erase(unique(all(ways2)), ways2.end());
    ll res = 0;
    for (int i : ways2) res += ways[(1ll<<20)-1-(i&&((1<<20)-1))];
    cout << res - (tot != 0) << "\n";
}

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

    solve();

    return 0;
}