#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repr(i,N) for(int i = (N) - 1; i >= 0; i--)
#define rep1(i,N) for(int i = 1; i <= (N) ; i++)
#define repr1(i,N) for(int i = (N) ; i > 0 ; i--)
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define vrep(v,it) for(auto it = v.begin(); it != v.end(); it++)
#define vrepr(v,it) for(auto it = v.rbegin(); it != v.rend(); it++)
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
using namespace std; void solve();
using ll = long long; using vl = vector<ll>;
using vi = vector<int>; using vvi = vector< vector<int> >;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,...) do { cerr << #v << " = "; array_out(v , __VA_ARGS__ );} while(0)
#else
  #define trc(...)
  #define trca(...)
  int main(){solve();}
#endif
 
using P = pair<int,int>; using vp = vector<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;
/////////////////

const int MAX_ROW = 100000; // to be set appropriately
const int MAX_COL = 60; // 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];}
};

int GaussJordan(BitMatrix &A, bool is_extended = false) {
    int rank = 0;
    for (int col = 0; col < A.W; ++col) {
        if (is_extended && col == A.W - 1) break;
        int pivot = -1;
        for (int row = rank; row < A.H; ++row) {
            if (A[row][col]) {
                pivot = row;
                break;
            }
        }
        if (pivot == -1) continue;
        swap(A[pivot], A[rank]);
        for (int row = 0; row < A.H; ++row) {
            if (row != rank && A[row][col]) A[row] ^= A[rank];
        }
        ++rank;
    }
    return rank;
}

void solve(){
  ini(N);
  vi cnt(60, 0) , exist(60 , 0);
  vl v(N); in(v);
  rep(i , N){
    ll x = v[i];
    rep(j , 60){
      cnt[j] += x & 1;
      exist[j] |= (x & 1);
      x >>= 1;
    }
  }
  trc(cnt);
  trc(exist);
  rep(i,60) cnt[i] &= 1;
  vi list;
  rep(i , 60) if(exist[i] == 1 && cnt[i] == 0) list.pb(i);
  reverse(all(list));
  trc(list);
  BitMatrix bit(N , (int)list.size());
  rep(i,N) rep(j , (int)list.size()){
    bit[i][j] = (v[i] & (1LL << list[j])) ? 1 : 0;
  }
  GaussJordan(bit);
  #ifdef NyaanDebug
  rep(i,N){
    rep(j,(int)list.size()) cerr << bit[i][j] <<  " ";
    cerr << endl;
  }
  #endif
  ll gauss = 0;
  rep(i,N) {
    ll cur = 0;
    rep(j , (int)list.size()){
      cur <<= 1;
      cur += bit[i][j];
    }
    trc(gauss , cur);
    gauss = max(gauss , gauss ^ cur);
  }
  trc(gauss);

  vi ans(60 , 0);
  reverse(all(list));
  rep(i , (int)list.size()){
    if(gauss & (1LL << i)) ans[list[i]] = 2;
    else ans[list[i]] = 0;
  }
  rep(i,60) if(exist[i]==1 && cnt[i]==1) ans[i] = 1;
  trc(ans);
  reverse(all(ans));
  ll nyaa = 0;
  rep(i,60){
    nyaa = nyaa * 2 + ans[i];
  }
  out(nyaa);
}

Measured memory_bytes: 1792