#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
#define FOR(i, f, t)        for(int(i)=(f);(i)<(t);(++i))

int N;
ll A[111111];

int main(){
    do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0);
    cin >> N;
    REP(i,N) cin >> A[i];
    sort(A, A+N, greater<ll>());

    int res = 0;
    REP(i,N){
        if(A[i] == 0) break;
        res++;
        ll x = 1LL<<(64-__builtin_clzll(A[i])-1);
        FOR(j,i+1,N){
            if(!(A[j]&x))break;
            A[j] ^= A[i];
        }
        sort(A+i+1, A+N, greater<ll>());
    }
    cout << (1LL<<res) << endl;
}