#include <stdio.h>
#include <utility>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
#define REP2(i,m,n) for(long i=(long)m;i<(long)n;++i)
#define REP(i,n) REP2(i,0,n)

void yesno(bool flag){
    cout<<(flag?"Yes":"No")<<endl;
}

// 引数：vector配列の先頭ポインタ,vector本数,bit数　返り値：基底bitのリスト　影響：配列が掃き出し後の状態に
vector<long> binary_xor_elimination(vector<long> A[],long n,long b){
    sort(A,A+n);
    reverse(A,A+n);
    vector<long> res;
    REP(i,n){
        long maxb=0;
        while(maxb<b && A[i][maxb]==0) maxb++;
        if(maxb<b){
            res.push_back(maxb);
            REP2(j,i+1,n){
                if(A[j][maxb]==1){
                    REP(k,b) A[j][k]^=A[i][k];
                }
            }
            sort(A+i+1,A+n);
            reverse(A+i+1,A+n);
        }
    }
    return res;
}

vector<long> base2(long x){
    vector<long> res;
    REP(i,64){
        res.push_back(x%2);
        x/=2;
    }
    return res;
}

int main(){
    long n;
    cin>>n;
    long a[n];
    REP(i,n) cin>>a[i];
    vector<long> v[n];
    REP(i,n) v[i]=base2(a[i]);
    vector<long> bitlist=binary_xor_elimination(v,n,64);
    long l=bitlist.size();
    cout<<(1LL<<l)<<endl;
    return 0;
}