#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
bool comp(int i, int j)
{
return i>j;
}
int main()
{
int N;
scanf("%d",&N);
vll dt;
for (int q=0;q<N;++q)
{
ll x;
scanf("%lld",&x);
dt.push_back(x);
}
sort( dt.rbegin(), dt.rend() );
//sort(dt.begin(), dt.end(), comp);
ll sig = 1;
while (sig <= dt[0])
sig<<=1;
sig>>=1;
for (int st = 0;sig>=1;sig>>=1)
{
int i = st;
while (i<N && (dt[i]&sig)==0)
i++;
if (i>=N)
continue;
swap( dt[st], dt[i] );
for (int j=0;j<N;++j)
if (j!=st && (dt[j]&sig)!=0)
dt[j] ^= dt[st];
st++;
}
ll ret = 0;
for (int q=0;q<N;++q)
ret ^= dt[q];
printf("%lld\n",ret);
return 0;
}
I2luY2x1ZGUgPGNzdGRpbz4KI2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPHZlY3Rvcj4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKdHlwZWRlZiBsb25nIGxvbmcgbGw7CnR5cGVkZWYgdmVjdG9yPGxsPiB2bGw7Cgpib29sIGNvbXAoaW50IGksIGludCBqKQp7CglyZXR1cm4gaT5qOwp9CgppbnQgbWFpbigpCnsKICAgIGludCBOOwogICAgc2NhbmYoIiVkIiwmTik7CiAgICB2bGwgZHQ7IAogICAgZm9yIChpbnQgcT0wO3E8TjsrK3EpIAogICAgewogICAgICAgIGxsIHg7CgkJc2NhbmYoIiVsbGQiLCZ4KTsgCgkJZHQucHVzaF9iYWNrKHgpOwogICAgfQogICAgc29ydCggZHQucmJlZ2luKCksIGR0LnJlbmQoKSApOwogICAgLy9zb3J0KGR0LmJlZ2luKCksIGR0LmVuZCgpLCBjb21wKTsKICAgIGxsIHNpZyA9IDE7CiAgICB3aGlsZSAoc2lnIDw9IGR0WzBdKSAKCQlzaWc8PD0xOyAKCXNpZz4+PTE7CiAgICBmb3IgKGludCBzdCA9IDA7c2lnPj0xO3NpZz4+PTEpCiAgICB7CiAgICAgICAgaW50IGkgPSBzdDsKICAgICAgICB3aGlsZSAoaTxOICYmIChkdFtpXSZzaWcpPT0wKSAKCQkJaSsrOwogICAgICAgIGlmIChpPj1OKSAKCQkJY29udGludWU7CiAgICAgICAgc3dhcCggZHRbc3RdLCBkdFtpXSApOwogICAgICAgIGZvciAoaW50IGo9MDtqPE47KytqKSAKCQkJaWYgKGohPXN0ICYmIChkdFtqXSZzaWcpIT0wKQogICAgICAgICAgICAJZHRbal0gXj0gZHRbc3RdOwogICAgICAgIHN0Kys7CiAgICB9CiAgICBsbCByZXQgPSAwOwogICAgZm9yIChpbnQgcT0wO3E8TjsrK3EpIAoJCXJldCBePSBkdFtxXTsKICAgIHByaW50ZigiJWxsZFxuIixyZXQpOwogICAgcmV0dXJuIDA7Cn0KCgo=