#include <bits/stdc++.h>

using namespace std;

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

#define fi first
#define se second
#define pp push_back
#define all(x) (x).begin(), (x).end()
#define Ones(n) __builtin_popcount(n)
#define endl '\n'
#define mem(arrr, xx) memset(arrr,xx,sizeof arrr)
//#define int long long
#define debug(x) cout << (#x) << " = " << x << endl

void Gamal() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifdef Clion
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

int dx[] = {+0, +0, -1, +1, +1, +1, -1, -1};
int dy[] = {-1, +1, +0, +0, +1, -1, +1, -1};

const double EPS = 1e-9;
const ll OO = 0X3F3F3F3F3F3F3F3F;
const int N = 2e5 + 5, INF = INT_MAX, MOD = 1e9 + 7, LOG = 20;

struct Basis {
    vector<ll> basis;
    int LOG, sz;

    Basis(int log = 61) {
        LOG = log;
        sz = 0;
        basis.resize(LOG);
    }

    bool insert(ll x) {
        for (int i = LOG - 1; i >= 0; --i) {
            if (x >> i & 1 ^ 1)continue;
            if (basis[i]) {
                x ^= basis[i];
            } else {
                basis[i] = x;
                sz++;
                return true;
            }
        }
        return false;
    }

    ll getMax(ll x = 0) {
        ll ret = x;
        for (int i = LOG - 1; i >= 0; --i) {
            ret = max(ret, ret ^ basis[i]);
        }
        return ret;
    }
};

void solve() {
    int n;
    cin >> n;
    vector<ll> v(n);
    ll x = -1;
    bool zero = false;
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
        if(v[i])x &= v[i];
        zero |= v[i] == 0;
    }
    Basis bs;
    for (int i = 0; i < n; ++i) {
        if(!v[i])continue;
        bs.insert(v[i] ^ x);
    }
    ll ans = 1;
    for (int i = 0; i < bs.sz; ++i) {
        ans *= 2;
    }
    if (x && zero)ans++;
    cout << ans;
}


signed main() {
    Gamal();
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}