#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define lfs <<fixed<<setprecision(10)<<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = n; i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = n - 1; i >= (ll)(m); i--)
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
template<typename T>
void emp(map<T,ll>&m, T x){m.emplace(x,0).first->second++;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}

const ll MAX_W=110000;
struct BitMatrix {
  ll h,w;
  vector<bitset<MAX_W>>A;
  BitMatrix() {};
  BitMatrix(ll n, ll m) :h(n),w(m){
    A.assign(h,bitset<MAX_W>(0));
  };
  BitMatrix(vector<vector<ll>>v):h(v.size()),w(v[0].size()){
    A.assign(h,bitset<MAX_W>(0));
    for(ll i=0;i<h;i++)for(ll j=0;j<w;j++)A[i][j]=(v[i][j]&1);  
  }
  ll height() {
    return h;
  }

  ll width() {
    return w;
  }

  inline bitset<MAX_W> &operator[](ll k) {
    return A[k];
  }
  friend ostream &operator<<(ostream &os, BitMatrix &p) {
    ll n = p.height(), m = p.width();
    for(ll i = 0; i < n; i++) {
      os << "[";
      for(ll j = 0; j < m; j++) {
        os << p[i][j] << (j + 1 == m ? "]\n" : ",");
      }
    }
    return (os);
  }
};

void GaussJordan(BitMatrix &a, bool is_extended){
  ll h = a.height(), w = a.width();
  ll rank = 0;
  ll limit = w - is_extended;
  vector<bool>use(h,true);
  for(ll col=0;col<limit;col++){
    ll pivot = -1;
    for(ll row=0;row<h;row++){
      if(use[row]&&a[row][col]){
        pivot=row;
        use[pivot]=false;
        break;
      }
    }
    if(pivot==-1)continue;
    auto tmp=a[pivot][col];
    //swap(a[pivot],a[rank]);
    for(ll row=0;row<h;row++){
      if(row!=pivot&&a[row][col]!=0){
        a[row]^=a[pivot];
      }  
    }
  }
}
vector<bool>linear_equation(BitMatrix a){
  ll h=a.height(),w=a.width();
  GaussJordan(a,true);
  vector<bool>ret;
  //for(ll row=rank;row<h;row++)if(a[row][w-1])return ret;
  ret.assign(h,false);
  for(ll i=0;i<h;i++){
    bool judge=false;
    for(ll j=0;j<w-1;j++)if(a[i][j])judge=true;
    if(judge||!a[i][w-1])ret[i]=true;
  }
  return ret;
}

int main(){
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);
  ll res=0,res1=INF,res2=-INF,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<ll>a(n);
  rep(i,0,n)cin>>a[i];
  ll xorbuf=0;
  rep(i,0,n)xorbuf^=a[i];
  vector<ll>idx;
  bitset<60> k=xorbuf;
  rrep(i,60,0)if(!k[i])idx.PB(i);
  BitMatrix v(idx.size(),n+1);
  rep(i,0,n){
    bitset<60>x=a[i];
    rep(j,0,idx.size())if(x[idx[j]])v[j][i]=1;
  }
  rep(i,0,idx.size())v[i][n]=1;
  auto ret=linear_equation(v);
  bitset<60>x=0;
  rep(i,0,idx.size())if(ret[i])x[idx[i]]=1;
  //cout<<xorbuf spa x<<endl;
  cout<<xorbuf+x.to_ullong()*2<<endl;
  return 0;
}

Measured memory_bytes: 2688