#include <bits/stdc++.h>
#pragma comment(linker, "/stack:247474112")
using namespace std;
const long long mod = 1e9 + 7;
const int inf = 1e9;
const long long infL = 1e18;
long long setbit(long long n, int pos) { return n = n | (1LL << pos); }
int resetbit(int n, int pos) { return n = n & ~(1 << pos); }
bool checkbit(long long n, int pos) { return (bool)(n & (1LL << pos)); }
template <typename T>
T mul(T x, T y) {
  x %= mod;
  y %= mod;
  return (x * y) % mod;
}
template <typename T>
T add(T x, T y) {
  x %= mod;
  y %= mod;
  return (x + y) % mod;
}
template <typename T>
T modPow(T x, T k, T mod) {
  if (k == 0) return 1;
  if (k & 1) {
    return ((x % mod) * modPow(x, k - 1, mod) % mod) % mod;
  } else {
    T ret = modPow(x, k / 2, mod);
    ret %= mod;
    return (ret * ret) % mod;
  }
}
template <typename T>
T ext_gcd(T num1, T num2, T &X, T &Y) {
  T r2, r1, q2, q1, x2, x1, y2, y1, x, y, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = num1, r1 = num2; r1 != 0;
       y2 = y1, y1 = y, x2 = x1, x1 = x, r2 = r1, r1 = r) {
    q1 = r2 / r1;
    x = x2 - q1 * x1;
    y = y2 - q1 * y1;
    r = r2 % r1;
  }
  X = x2;
  Y = y2;
  return r2;
}
template <typename T>
T modInv(T x, T m) {
  return modPow(x, m - 2, m);
}
template <typename T>
void print(const T &v) {
  cerr << v << ' ';
}
template <typename T1, typename... T2>
void print(const T1 &first, const T2 &...rest) {
  print(first);
  print(rest...);
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
  return os << "[ " << p.first << ", " << p.second << " ]";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  for (int i = 0; i < v.size(); i++) os << v[i] << ' ';
  return os << " ]";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "[ ";
  for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
    os << *it << ' ';
  return os << " ]";
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &v) {
  os << "[ ";
  for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
    os << *it << ' ';
  return os << " ]";
}
const int M = 2e6 + 7;
const int mx = (int)42;
struct Node {
  int cnt;
  Node *nxt[2];
  Node() {
    cnt = 0;
    for (int i = 0; i < 2; i++) nxt[i] = NULL;
  }
};
struct Trie {
  Node *head, *curr, *dummy;
  Trie() { head = curr = new Node(); }
  void insert(long long x) {
    curr = head;
    string s = "";
    for (int i = mx; i >= 0; i--) {
      if (checkbit(x, i)) {
        s += '1';
      } else {
        s += '0';
      }
    }
    for (int i = 0; i < s.size(); i++) {
      int tmp = s[i] - '0';
      if (curr->nxt[tmp] == NULL) {
        curr->nxt[tmp] = new Node();
      }
      curr = curr->nxt[tmp];
      curr->cnt++;
    }
  }
  long long search(long long x) {
    curr = head;
    string fuck = "";
    string s = "";
    for (int i = mx; i >= 0; i--) {
      s += ((int)checkbit(x, i) + '0');
    }
    for (int i = 0; i < s.size(); i++) {
      int tmp = s[i] - '0';
      if (tmp == 0) {
        if (curr->nxt[1] != NULL) {
          fuck += "1";
          curr = curr->nxt[1];
        } else {
          fuck += "0";
          curr = curr->nxt[tmp];
        }
      } else {
        if (curr->nxt[0] != NULL) {
          curr = curr->nxt[0];
          fuck += "1";
        } else {
          curr = curr->nxt[tmp];
          fuck += "0";
        }
      }
    }
    long long ret = 0LL;
    int cnt = mx;
    for (int i = 0; i < fuck.size(); i++) {
      if (fuck[i] == '1') ret = setbit(ret, cnt);
      cnt--;
    }
    return ret;
  }
  void del(int x) {
    curr = head;
    string s = "";
    for (int i = 30; i >= 0; i--) {
      if (checkbit(x, i)) {
        s += '1';
      } else {
        s += '0';
      }
    }
    for (int i = 0; i < s.size(); i++) {
      int tmp = s[i] - '0';
      curr = curr->nxt[tmp];
      curr->cnt--;
    }
  }
};
long long a[M + 2], b[M + 2];
void solve() {
  long long n, ans = 0;
  Trie d;
  cin >> n;
  a[0] = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    a[i] ^= a[i - 1];
  }
  d.insert(0);
  ans = max(ans, a[n]);
  for (int i = 1; i <= n; i++) {
    d.insert(a[i]);
    ans = max(ans, d.search(a[n] ^ a[i]));
  }
  cout << ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) solve();
  return 0;
}
