#pragma GCC optimize("Ofast")
 
#include <bits/stdc++.h>   
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;   
using namespace std;
#define ll long long
#define ld long double
#define nline "\n"
#define f first
#define s second
#define sz(x) (ll)x.size()
#define vl vector<ll>
const ll INF_MUL=1e13;
const ll INF_ADD=1e18;
#define all(x) x.begin(),x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
//--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------     
const ll MOD=998244353;
const ll MAX=500500;
struct get_xor{
    array<ll,61> basis;
    get_xor(){
        for(ll bit=0;bit<=60;bit++){
            basis[bit]=0; 
        }
    }
    void insert_mask(ll mask){
        for(ll bit=0;bit<=60;bit++){
            if(mask&(1ll<<bit)){
                if(!basis[bit]){
                    basis[bit]=mask;
                    return; 
                }
                mask^=basis[bit]; 
            }
        }
    }
};
void solve(){ 
  ll n,total=0; cin>>n;
  get_xor track;
  for(ll i=1;i<=n;i++){
    ll x; cin>>x;
    track.insert_mask(x);
    total^=x;
  }
  ll ans=total+1,cur=0;
  for(ll i=0;i<=60;i++){
    ll l=cur,r=total^cur;
    l++;
    ans=max(ans,l+r);
    if(cur&(1ll<<i)){
      ;
    }
    else{
      cur^=track.basis[i];
    }
  }
  cout<<ans<<nline;
  return;    
}  
int main()                                                                                 
{         
  ios_base::sync_with_stdio(false);                         
  cin.tie(NULL);                              
  ll test_cases=1;                 
  //cin>>test_cases;
  while(test_cases--){
    solve();
  }
  cout<<fixed<<setprecision(12);  
  cerr<<"Time:"<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n"; 
}