#include <bits/stdc++.h>
#pragma GCC target("sse2")
#pragma GCC optimization("O2")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize "trapv"
using namespace std;
const int maxn = 1000500;
inline int g() {
  int x;
  cin >> x;
  return x;
}
inline long long gl() {
  long long x;
  cin >> x;
  return x;
}
inline char gc() {
  char x;
  cin >> x;
  return x;
}
inline string gs() {
  string s;
  cin >> s;
  return s;
}
template <typename T>
inline vector<T> gv(int len) {
  vector<T> a(len);
  for (auto &it : a) cin >> it;
  return a;
}
inline vector<int> gv(int len) {
  vector<int> a(len);
  for (auto &it : a) cin >> it;
  return a;
}
inline vector<pair<int, int>> gv_andPairCnt(int len) {
  vector<pair<int, int>> a(len);
  int i = 1;
  for (auto &it : a) {
    it.second = i;
    i++;
    cin >> it.first;
  }
  return a;
}
double power_log(double power, double val) { return log(val) / log(power); }
template <typename T>
T sqr(T x) {
  return x * x;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (auto it : v) os << it << ", ";
  os << "\n";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const deque<T> &v) {
  os << "deque:{";
  for (auto it : v) os << it << " ";
  os << "}\n";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "set:{";
  for (auto it : v) os << it << " ";
  os << "}";
  return os;
}
template <typename T, typename T2>
ostream &operator<<(ostream &os, const map<T, T2> &v) {
  os << "map:{\n";
  for (auto it : v) os << "    {" << it.first << " <> " << it.second << "}\n";
  os << "}\n";
  return os;
}
template <typename T, typename T2>
ostream &operator<<(ostream &os, const pair<T, T2> &v) {
  os << "{" << v.first << ", " << v.second << "}";
  return os;
}
template <typename T, typename H>
inline vector<pair<T, H>> gv_andBiPair(int len) {
  vector<pair<T, H>> a(len);
  for (auto &it : a) {
    cin >> it.first >> it.second;
  }
  return a;
}
template <typename T>
inline set<T> vector_to_set(const vector<T> &vec) {
  set<T> s;
  for (auto &it : vec) s.insert(it);
  return s;
}
const long long md = 1e9 + 7;
struct Node {
  int cnt = 0;
  int sign = 0;
  Node *l = nullptr, *r = nullptr;
};
bool isNull(Node *src) { return src == nullptr || src->cnt == 0; }
bool isOne(long long msk, long long lvl) {
  assert(lvl >= 0);
  return (msk & (1LL << lvl)) > 0;
}
void add(Node *root, long long val, int m) {
  for (int i = 45; i >= 0; i--) {
    root->cnt += m;
    if (isOne(val, i)) {
      if (root->r == nullptr) {
        root->r = new Node();
        root->r->sign = 1;
      }
      root = root->r;
    } else {
      if (root->l == nullptr) {
        root->l = new Node();
      }
      root = root->l;
    }
  }
  root->cnt += m;
}
long long findMax(Node *root, long long val, int lvl) {
  if (isNull(root)) {
    return 0LL;
  }
  long long s = 0;
  if (lvl != 46) {
    s += (1LL << lvl) * (isOne(val, lvl) ^ root->sign);
  }
  if (lvl == 0) {
    return s;
  }
  if ((!isOne(val, lvl - 1) && !isNull(root->r)) || isNull(root->l)) {
    s += findMax(root->r, val, lvl - 1);
  } else {
    s += findMax(root->l, val, lvl - 1);
  }
  return s;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  Node *root = new Node();
  int n = g();
  auto v = gv<long long>(n);
  vector<long long> pref(maxn);
  add(root, 0, 0);
  for (int i = 1; i <= n; i++) {
    pref[i] = pref[i - 1] ^ v[i - 1];
    add(root, pref[i], 1);
  }
  long long ans = *max_element(pref.begin(), pref.end());
  long long xr = 0;
  for (int i = n; i >= 1; i--) {
    add(root, pref[i], -1);
    xr ^= v[i - 1];
    ans = max(ans, xr);
    ans = max(ans, findMax(root, xr, 46));
  }
  cout << ans;
}
