#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cmath>
#define MAXN 100000
using namespace std;
int n,a[10100];
long long ans=0;
void dfs(int k,long long  temp)
{
	if (temp>ans) ans=temp;
	if (k>n) return;
	dfs(k+1,temp);
	if (!temp) dfs(k+1,a[k]);
	else dfs(k+1,a[k]^temp);
}
int main()
{
	freopen("xor_equ.in","r",stdin);
	freopen("xor_equ.out","w",stdout);
	ios::sync_with_stdio(false);
	cin>>n;
	for (int i=1;i<=n;i++)
		cin>>a[i];
	dfs(0,0);
	cout<<ans<<endl;
	fclose(stdin);
	fclose(stdout);
	return 0;
}