#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll BIT = 41;
vector<int> component;
int find(int x) {
    return (component[x] < 0) ? x : (component[x] = find(component[x]));
}
bool join(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return false;
    if (component[x] > component[y]) swap(x,y);
    component[x] += component[y];
    component[y] = x;
    return true;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int n; cin >> n;
    if (n == 1) {
        cout << 1 << "\n";
        return 0;
    }
    bool hasZero = false;
    vector<ll> vals(n, 0);
    vector<bool> inDeg(BIT, false);
    component.assign(BIT, -1);
    vector<vector<bool>> edges(BIT, vector<bool>(BIT, false));
    int totComp = BIT;
    ll vand = -1;
    for (int i = 0; i < n; i++) {
        ll v; cin >> v;
        vand = vand & v;
        vals[i] = v;
        if (v == 0) hasZero = true;
        vector<int> unset;
        vector<int> set;
        for (int j = 0; j < BIT; j++) {
            if ((v>>j)&1) {
                set.push_back(j);
            } else {
                unset.push_back(j);
            }
        }
        for (int a : set) for (int b : unset) {
            edges[a][b] = true;
            if (edges[b][a]) {
                if (join(a,b)) {
                    totComp--;
                }
            }
        }
    }
    for (int i = 1; i < BIT; i++) {
        for (int j = 0; j < i; j++) {
            if (!edges[i][j] && !edges[j][i]) {
                join(i, j);
                component[find(i)]++;
                totComp--;
                break;
            }
        }
    }
    ll res = -1 + (vand == 0);
    for (int i = 0; i < BIT; i++) {
        if (find(i) == i) {
            // cout << i << " " << component[i] << "\n";
            res += (1ll << (-component[i])) - 1;
        }
    }
    cout << res << "\n";
}

/*

4
2 1 7 11

*/