#include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i,n) for(ll i = 0; i < (n); ++i)
#define srep(i,s,t) for(ll i = s; i < t; ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
using namespace std;
// using namespace atcoder;
typedef long long int ll;
typedef pair<ll,ll> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 500005

vector<ll> kitei(vector<ll> a){
    int n = a.size();
    int now = 0;
    for(int i = 62; i >= 0; i--){
        for(int j = now + 1; j < n; j++){
            if(a[j] & (1LL<<i)){
                swap(a[now], a[j]);
                break;
            }
        }
        if(!(a[now] & (1LL<<i))) continue;
        for(int j = 0; j < n; j++){
            if(j != now && (a[j] & (1LL<<i))) a[j] ^= a[now];
        }
        now++;
        if(now == n) break;
    }
    vector<ll> res;
    for(int i = 0; i < now; i++) res.push_back(a[i]);
    return res;
}

int main() {
    int n; cin >> n;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    
    vector<ll> v = kitei(a);

    int m = v.size();
    ll ans = 1LL << m;
    cout << ans << endl;
    return 0;
}