#include<cstdio>
#include<deque>
#include<iostream>
using namespace std;
typedef long long LL;
const int SIZEN=10010;
int N;
LL f[SIZEN]={0};
LL ans=0;
deque<LL> Q;
bool check(LL x,int y)//当前位是否为1
{
	int temp;
	temp=x>>(y-1);
	return temp&1;
}
void read()
{
	int i;
	scanf("%d",&N);
	for(i=1;i<=N;i++) scanf("%lld",&f[i]);
}
void work()
{
	for(int k=63;k>=1;k--)
	{
		Q.clear();
		for(int i=1;i<=N;i++)
		{
			if(check(f[i],k))
			{
				Q.push_back(i);
			}
		}
		if(Q.empty()) continue;
		LL now=f[Q[0]];
		//cout<<now<<endl;
		if(!check(ans,k)) ans^=now;
		for(int i=0;i<Q.size();i++) 
		{
			int v=Q[i];
			f[v]^=now;
		}
	}
	printf("%lld",ans);
}
int main()
{
	freopen("xor_equ.in","r",stdin);
	freopen("xor_equ.out","w",stdout);
	read();
	work();
	return 0;
}