#include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
// Cope Counter = at least 142

ll basis[62];

void insert(ll val) {
  for(ll i = 0; i < 62; i++) {
    if((val & (1ll << i)) == 0) continue;
    if(!basis[i]) {
      basis[i] = val;
      return;
    }
    val ^= basis[i];
  }
}
bool find(ll val) {
  for(ll i = 0; i < 62; i++) {
    if((val & (1ll << i)) == 0) continue;
    if(!basis[i]) return 0;
    val ^= basis[i];
  }
  return 1;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
  for(int i = 0; i < 62; i++) basis[i] = 0;
  ll n;
  cin >> n;
  ll cur, bk = 0;
  for(ll i = 0; i < n; i++) {
    cin >> cur;
    bk ^= cur;
    insert(cur);
  }
  ll ans = 0;
  for(ll i = 1; i < 62; i++) {
    if(find((1ll << i) - 1)) ans = max(ans, bk ^ ((1ll << (i + 1)) - 1));
  }
  cout << ans << "\n";
}