#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y));
#define chmax(x,y) x = max((x),(y));
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e17;
const int MOD = 1000000007;
//const int MOD = 998244353;
const double PI = 3.14159265358979323846;


int main(){
    int n;
    cin >> n;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    int rank = 0;
    for(int i=0;i<=60;i++){
        int idx = -1;
        rep(j,n){
            if(a[j]>>i&1){
                if(idx==-1) idx = j;
                else{
                    a[j] ^= a[idx];
                }
            }
        }
        if(idx>=0) swap(a[rank++],a[idx]);
    }
    cout << (1LL<<rank) << endl;
    return 0;
}