#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n;
ll a[1000005];
ll w[65];
int rnk;
void insert(ll val){
	rep(k,0,59){
		if(((val >> k) & 1) == 0) continue;
		if(!w[k]){
			w[k] = val;
			rnk++;
			return;
		}
		val ^= w[k];
	}
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&n);
	ll sum = 0,answer = 0;
	rep(i,1,n){
		scanf("%lld",&a[i]);
		insert(a[i]);
		sum ^= a[i];
	}

	ll cur = 0,qwq = 0;
	rep(k,0,59){
		qwq += 1ll << k;
		if(k){
			if(((cur >> k) & 1) == 0) chkmax(answer,sum ^ qwq);
			else if(w[k]) chkmax(answer,sum ^ qwq);
		}
		if(((cur >> k) & 1) == 0){
			if(!w[k]) break;
			cur ^= w[k];
		}
	}
	if(rnk < n) chkmax(answer,sum ^ 1);
	printf("%lld\n",answer);
	return 0;
}