#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<long> binary_xor_elimination(long v[],long n){
    sort(v,v+n);
    reverse(v,v+n);
    vector<long> res;
    REP(i,n){
        long b=63;
        while(b>=0 && ((1LL<<b & v[i])==0)) b--;
        if(b!=-1){
            res.push_back(b);
            REP2(j,i+1,n){
                if(1LL<<b & v[j]) v[j]^=v[i];
            }
            sort(v+i+1,v+n);
            reverse(v+i+1,v+n);
        }
    }
    return res;
}

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