#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;

int main(){

    long long N, rank=0;
    cin >> N;
    deque<long long> A(N);
    for (int i=0; i<N; i++) cin >> A[i];

    for (int i=0; i<=60; i++){
        bool f=0;
        if (1LL<<i & A[rank]) f = 1;
        else{
            for (int j=rank+1; j<N; j++){
                if (1LL<<i & A[j]){
                    swap(A[rank], A[j]);
                    f = 1;
                    break;
                }
            }
        }
        if (f){
            for (int j=rank+1; j<N; j++){
                if (1LL<<i & A[j]) A[j] ^= A[rank];
            }
            rank++;
        }
    }

    cout << (1LL<<rank) << endl;

    return 0;
}