#include <bits/stdc++.h>
using namespace std;
const long long m = 63;
long long p[m], f, n, l;
void xxj(long long x) 
{
    for (int i = m; i >= 0; i--) 
    {
        if (x >> i == 1) 
        {
            if (p[i] == 0) 
            {
                p[i] = x;
                return;
            } else 
            {
                x ^= p[i];
            }
        }
    }

    f = 1;
}
long long pp() 
{
    long long a = 0;

    for (int i = m; i >= 0; i--) 
    {
        a = max(a, a ^ p[i]);
    }

    return a;
}
int main() 
{
    cin >> n;

    for (int i = 1; i <= n; i++) 
    {
        cin >> l;
        xxj(l);
    }

    cout << pp();
}