#include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod

vec v, pos(60, -1);
void insert(int x){
    IREP(i, 60) if((x >> i) & 1){
        if(pos[i] != -1) x ^= v[pos[i]];
        else{
            v.pb(x);
            pos[i] = SZ(v) - 1;
            break;
        }
    }
}

int BinaryMat_calcrank(mat A){
    int n = A.size(), m = A[0].size();
    int r = 0, j = 0;
    REP(i, n){
        bool f = false;
        while(!f && j < m){
            FOR(i2, i, n){
                if(A[i2][j]){
                    A[i].swap(A[i2]);
                    r++;
                    f = true;
                    break;
                }
            }
            if(f){
                FOR(i2, i + 1, n) if(A[i2][j]){
                    FOR(j2, j, m) A[i2][j2] ^= A[i][j2];
                }
            }
            j++;
        }
    }
    return r;
}

bool check(vec d, vec r){
    int n = SZ(d), m = SZ(v);
    mat A(n, vec(m, 0));
    REP(i, n){
        REP(j, m) if((v[j] >> d[i]) & 1) A[i][j] = 1;
    }
    int r1 = BinaryMat_calcrank(A);
    REP(i, n) A[i].pb(r[i]);
    int r2 = BinaryMat_calcrank(A);
    return (r1 == r2);
}

signed main(){

    int N; cin >> N;
    vec A(N); cin >> A;
    int tot = 0;
    REP(i, N) tot ^= A[i];

    REP(i, N) insert(A[i]);
    //vdebug(v); vdebug(pos);

    int ans = 0;
    vec d, r;
    IREP(i, 60){
        if((tot >> i) & 1) ans += bit(i);
        else{
            d.pb(i); r.pb(1);
            if(check(d, r)){
                ans += bit(i + 1);
            }else{
                r.back() = 0;
            }
        }
    }
    Out(ans);

    return 0;
}


Measured memory_bytes: 1152