#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;
}

int main(){
    long n;
    cin >> n;
    long a[n];
    REP(i,n) cin >> a[i];
    sort(a,a+n);
    reverse(a,a+n);

    set<long> ans_list;

    REP(i,n){
        long b=62;
        while(b>=0 && ((1LL<<b & a[i])==0)) b--;
        if(b!=-1){
            REP2(j,i+1,n){
                if(1LL<<b & a[j]) a[j]^=a[i];
            }
            sort(a+i+1,a+n);
            reverse(a+i+1,a+n);
            ans_list.insert(b);
          //cout << b << "th bit" << endl;
        }
    }
    long l=ans_list.size();
    cout << (1LL<<l) << endl;
    return 0;
}