#include <bits/stdc++.h>
using namespace std ;
const int MAXN=1e5+7;
const int INF = 0x3f3f3f3f;
typedef long long ll;
#define endl "\n"

typedef unsigned long long ull;

vector<ull> B;
void insert(ull x) {
    for (auto b : B)
        x = min(x, b ^ x);
    for (auto &b : B)
        b = min(b, b ^ x);
    if (x)
        B.push_back(x);
}

int check(ll x,int lim){
    for(auto b:B){
        ll t=x;
        for(int i=0;i<=lim;i++){
            if((b>>i)&1){
                t^=1ll<<i;
            }
        }
        x=min(x,t);
    }
    if(x==0){
        return 1;
    }else{
        return 0;
    }
}

void solve(){
	int n;
    cin>>n;
    ll a[n+1];
    ll cnt=0;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        insert(a[i]);
        cnt^=a[i];
    }
    sort(B.begin(),B.end());
    ll ans=0;
    for(int i=0;i<=60;i++){
        if(check((1ll<<i)-1,i)){
            ans=max(ans,cnt^((1ll<<(i+1))-1));
        }
    }
    cout<<ans<<endl;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	int t=1;
	
//	cin>>t;
	while(t--){
		solve();
	}
	
	return 0;
}