#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int rankMat(vector<vector<int> > A){
    int n = (int)A.size(), m = (int)A[0].size();

    for(int i = 0; i < min(n, m); ++i){
        for(int j = i; j < n; ++j){
            if(A[j][i]){
                swap(A[i], A[j]);
                break;
            }
        }
        if(A[i][i] == 0){
            continue;
        }
        for(int j = 0; j < n; ++j){
            if(i!=j && A[j][i]){
                for(int k = i; k < m; ++k){
                    A[j][k] ^= A[i][k];
                }
            }
        }
    }

    int r = n;
    for(int i = 0; i < n; ++i)
        if(accumulate(all(A[i]), 0) == 0)--r;
    return r;
}

int main(){
    const int M = 61;
    int N;
    cin >> N;
    vector<vi> A(N, vi(M));
    rep(i, N){
        ll a; scanf("%lld", &a);
        rep(j, M)if(a >> j & 1)A[i][j] = 1;
    }
    int r = rankMat(A);
    assert(r <= M);
    ll ans = 1ll << r;
    cout << ans << endl;
}