#include <bits/stdc++.h>
using namespace std;
typedef long long int i64;
#ifdef WINVER
#define QAQ "%I64d"
#else
#define QAQ "%lld"
#endif
i64 bb[64]; 

int main()
{
    freopen("xor_equ.in", "r", stdin);
#ifndef debug
    freopen("xor_equ.out", "w", stdout);
#endif
    int n; scanf("%d", &n);
    for (int i = 0; i < n; ++i)
    {
        i64 x; scanf(QAQ, &x);
        for (int j = 63; j >= 0; --j) if (x >> j & 1)  
        {
            if (bb[j]) x ^= bb[j];
            else { bb[j] = x; break; }
        }
    }
    i64 ans = 0;
    for (int i = 63; i >= 0; --i) 
        if ((ans ^ bb[i]) > ans) ans ^= bb[i];
    printf(QAQ"\n", ans);
}