#include <bits/stdc++.h>
#define REP(i, n)     for(int i = 0;i < n;i++)
#define REPR(i, n)    for(int i = n;i >= 0;i--)
#define FOR(i, m, n)  for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(),greater<long long>());
#define ALL(X) (X).begin(),(X).end()
#define INF 99999999
#define M_PI 3.14159265358979323846
#define MOD 1000000007

#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 0};
int dy[]={0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
 
std::string pad(int num){ char buffer[4]; std::snprintf(buffer, sizeof(buffer), "%03d", num); return buffer;}
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) os << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

int N;
vector<ull> A;

// 難しいから一旦飛ばす。

void input(){
    fast_io();
    #ifdef __LOCAL
        fs::path p = __FILE__;
        fs::path input,output;
        input = output = p.parent_path();
        input += string("/input/") + string(p.stem()) + string(".txt");
        output += string("/output/") + string(p.stem()) + string(".txt");
        freopen(input.c_str(), "r", stdin);
        freopen(output.c_str(), "w", stdout);
    #endif
    cin >> N ;
    A = fetch_vec<ull>(N);
}

ull umin(ull a, ull b){
    return (a<b)?a:b;
}

void solve(){
    input();
    ull SUM=0;
    for(auto a:A) SUM ^= a;
    DBG(bitset<60>(SUM))
    // for(auto a:A)だと答えが違ってた。
    // aに対して操作をする場合、for(auto a:A)だと順番が変わる場合がある？
    // まぁ良くない。
    for(int i=0;i<N;i++){
        A[i] &= ~SUM;
        DBG(bitset<60>(A[i]))
    }
    int j;
    // ジョルダン標準形を作る。
    int rank=0;
    for(int i=60; i>=0; i--){
        for(j=rank;j<N;j++) if(A[j] & (1LL<<i)) break;
        if(j==N) continue;
        if(j>rank){
            // a[rank]&(1LL<<i) is true
            DBG(bitset<60>(A[rank]))
            DBG(bitset<60>(A[j]))
            A[rank] ^= A[j];
            DBG(bitset<60>(A[rank]))
            }
        for(j=rank+1;j<N;j++){
            // j>rank, a[j]&(1<<i) is false
            A[j] = umin(A[j],A[j]^A[rank]);
            DBG(bitset<60>(A[j]))
            }
        rank++;
    }

    DBG("jordan_formatt")
    ull x=0;
    for(auto a:A){
        DBG(bitset<60>(a))
        x = max(x,x^a);
    }
    DBG(bitset<60>(x))
    DBG(x)
    DBG(SUM)
    cout << 2*x + SUM << endl;


}


int main()
{
    solve();
    return 0;
}


Measured memory_bytes: 1024