#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:https://atcoder.jp/contests/abc141/tasks/abc141_f>
 問題文============================================================
 F - Xor Sum 3
 =================================================================
 解説=============================================================
 
 ================================================================
 */


/*
 * 参照：http://drken1215.hatenablog.com/entry/2019/03/20/202800
 */
/*
* Gauss-Jordan( mod. 2)
*/

const int MAX_ROW = 100; // to be set appropriately
const int MAX_COL = 100010; // to be set appropriately
struct BitMatrix {
    int H, W;
    bitset<MAX_COL> val[MAX_ROW];
    BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
    inline bitset<MAX_COL>& operator [] (int i) {return val[i];}
};

// A : m x nの行列
// return : Aのrank
void GaussJordan(BitMatrix &A, bool is_extended = false) {
    vector<bool> used(A.H, 0);
    for (int col = 0; col < A.W; ++col) {
        if (is_extended && col == A.W - 1) break;
        int pivot = -1;
        for (int row = 0; row < A.H; ++row) {
            if (used[row]) continue;
            if (A[row][col]) {
                pivot = row;
                break;
            }
        }
        if (pivot == -1) continue;
        for (int row = 0; row < A.H; ++row) {
            if (row != pivot && A[row][col]) A[row] ^= A[pivot];
        }
        used[pivot] = true;
    }
}


template<class Type>
Type solve(Type res = Type()){
    int N; cin >> N;
    vector<ll> A(N); for(auto& in:A) cin >> in;
    
    int MAX_D = 60;
    BitMatrix M(MAX_D+1,N+1);
    vector<int> T(MAX_D+1);
    for(int d = MAX_D; d >= 0; d--){
        int cnt = 0;
        for(int i = 0; i < N;i++){
            if((A[i]>>d)&1) cnt++;
        }
        if(cnt == 0){
            T[d] = 1;
            continue;
        }
        if(cnt%2 == 1){
            T[d] = 1;
            res += (1LL<<d);
            continue;
        }
        
        for(int i = 0; i < N;i++){
            if((A[i]>>d)&1){
                M[MAX_D-d][i] = 1;
            }
        }
        M[MAX_D-d][N] = 1;
    }
    GaussJordan(M,true);
    
    for(int d = MAX_D; d >= 0; d--){
        if(T[d]) continue;
        
        bool ok = false;
        for(int i = 0; i < N;i++){
            if(M[MAX_D-d][i]){ ok = true;}
        }
        if(M[MAX_D-d][N] == 0) ok = true;
        
        if(ok) res += (2LL<<d);
    }
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    // solve(0);
    cout << fixed << setprecision(15) << solve<ll>() << endl;
    return 0;
}


Measured memory_bytes: 2304