#include <bits/stdc++.h>
#pragma GCC optmize(2)

#define i64 long long
#define ui64 unsigned i64
#define all(x) x.begin(), x.end()
#define seg(a, l, r) a + l, a + r + 1
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)

using namespace std;

const int N = 2e6 + 5, V = 64;

int n;
i64 a[N], basis[V];

void insert(i64 x) {
	rep(i, 0, V - 1) {
		if(!(x >> i & 1)) continue;

		if(basis[i] != 0) x ^= basis[i];
		else {
			rep(j, i + 1, V - 1) if(x >> j & 1) x ^= basis[j];
			rep(j, 0, i - 1) if(basis[j] >> i & 1) basis[j] ^= x;

			basis[i] = x;

			return;
		}
	}
}

template<typename T>
inline void read(T &x) {
	x = 0; char ch = getchar();
	while(!isdigit(ch)) ch = getchar();
	while( isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
}

int main() {


	// ios::sync_with_stdio(false);
	// cin.tie(nullptr); cout.tie(nullptr);

	read(n);
	rep(i, 1, n) read(a[i]), insert(a[i]);

	i64 sum = 0;
	rep(i, 1, n) sum ^= a[i];

	i64 ans = sum + 1;
	rep(i, 0, 61) {

		i64 xorSum = 0;
		rep(j, 0, i) xorSum ^= basis[j];
		
		ans = max(ans, sum ^ xorSum ^ (xorSum + 1));
	}

	printf("%lld\n", ans);

	return 0;
}