#include <bits/stdc++.h>
#define MOD 2
using namespace std;

template <int mod>
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(int64_t y)
      : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  ModInt &operator+=(const ModInt &p) {
    if((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const {
    return ModInt(*this) += p;
  }
  ModInt operator-(const ModInt &p) const {
    return ModInt(*this) -= p;
  }
  ModInt operator*(const ModInt &p) const {
    return ModInt(*this) *= p;
  }
  ModInt operator/(const ModInt &p) const {
    return ModInt(*this) /= p;
  }
  bool operator==(const ModInt &p) const {
    return x == p.x;
  }
  bool operator!=(const ModInt &p) const {
    return x != p.x;
  }
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while(b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
  ModInt pow(int64_t n) const {
    ModInt ans(1), mul(x);
    while(n) {
      if(n & 1) ans *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ans;
  }
  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }
  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt<mod>(t);
    return (is);
  }
  static int get_mod() { return mod; }
};

template <class T>
struct Matrix {
  vector<vector<T>> A;
  Matrix() {}
  Matrix(size_t m, size_t n) : A(m, vector<T>(n, 0)) {}
  Matrix(size_t n) : A(n, vector<T>(n, 0)) {}
  size_t height() const { return (A.size()); }
  size_t width() const { return (A[0].size()); }
  inline const vector<T> &operator[](int k) const {
    return (A.at(k));
  }
  inline vector<T> &operator[](int k) { return (A.at(k)); }
  static Matrix E(size_t n) {
    Matrix mat(n);
    for(int i = 0; i < n; ++i) mat[i][i] = 1;
    return (mat);
  }
  Matrix &operator+=(const Matrix &B) {
    size_t m = height(), n = width();
    assert(m == B.height() && n == B.width());
    for(int i = 0; i < m; ++i)
      for(int j = 0; j < n; ++j) (*this)[i][j] += B[i][j];
    return (*this);
  }
  Matrix &operator-=(const Matrix &B) {
    size_t m = height(), n = width();
    assert(m == B.height() && n == B.width());
    for(int i = 0; i < m; ++i)
      for(int j = 0; j < n; ++j) (*this)[i][j] -= B[i][j];
    return (*this);
  }
  Matrix &operator*=(const Matrix &B) {
    size_t m = height(), n = B.width(), p = width();
    assert(p == B.height());
    vector<vector<T>> C(m, vector<T>(n, 0));
    for(int i = 0; i < m; ++i)
      for(int k = 0; k < p; ++k) {
        T tmp = (*this)[i][k];
        for(int j = 0; j < n; ++j) C[i][j] += tmp * B[k][j];
      }
    A.swap(C);
    return (*this);
  }
  Matrix &operator^=(long long k) {
    Matrix B = Matrix::E(height());
    while(k) {
      if(k & 1) B *= *this;
      *this *= *this;
      k >>= 1;
    }
    A.swap(B.A);
    return (*this);
  }

  Matrix operator+(const Matrix &B) const {
    return (Matrix(*this) += B);
  }
  Matrix operator-(const Matrix &B) const {
    return (Matrix(*this) -= B);
  }
  Matrix operator*(const Matrix &B) const {
    return (Matrix(*this) *= B);
  }
  Matrix operator^(const long long k) const {
    return (Matrix(*this) ^= k);
  }
  friend ostream &operator<<(ostream &os, Matrix &p) {
    size_t m = p.height(), n = p.width();
    for(int i = 0; i < m; i++) {
      os << "[";
      for(int j = 0; j < n; j++) {
        os << p[i][j] << (j + 1 == n ? "]\n" : ",");
      }
    }
    return (os);
  }
};

int GaussJordan(Matrix<ModInt<MOD>> &A,
                bool is_extended = false) {
  int m = A.height(), n = A.width();
  vector<bool> used(m, 0);
  for(int col = 0; col < n; ++col) {
    if(is_extended && col == n - 1) break;
    int piv = -1;
    for(int row = 0; row < m; ++row)
      if(A[row][col] != 0 && !used[row]) {
        piv = row;
        break;
      }
    if(piv == -1) continue;
    for(int row = 0; row < m; ++row)
      if(row != piv && A[row][col] != 0) {
        for(int col2 = 0; col2 < n; ++col2)
          A[row][col2] -= A[piv][col2];
      }
    used[piv] = 1;
  }
  return 0;
}

long long n;
vector<long long> a;

long long solve();

int main() {
  cin >> n;
  a.resize(n);
  for(int i = 0; i < n; ++i) cin >> a[i];
  cout << solve() << endl;
  return 0;
}

long long solve() {
  long long ans = 0;
  vector<bool> memo(60, 0);
  for(long long i = 0; i < 60; ++i) {
    long long cnt = 0;
    for(int j = 0; j < n; ++j) cnt += (a[j] >> i) & 1;
    if(cnt % 2) {
      ans += 1LL << i;
      memo[i] = 1;
    }
    else if(cnt == 0)
      memo[i] = 1;
  }
  Matrix<ModInt<MOD>> mat(60, n + 1);
  for(long long i = 0; i < 60; ++i)
    for(int j = 0; j < n; ++j)
      mat[59 - i][j] = ((!memo[i]) && ((a[j] >> i) & 1));
  for(int i = 0; i < 60; ++i)
    if(!memo[59 - i]) mat[i][n] = 1;
  GaussJordan(mat, 1);
  for(int i = 0; i < 60; ++i)
    if(!memo[59 - i]) {
      bool ch = 0;
      for(int j = 0; j < n; ++j)
        if(mat[i][j] == 1) ch = 1;
      if(mat[i][n] == 0) ch = 1;
      if(ch) ans += 2 * (1LL << (59 - i));
    }
  return ans;
}

Measured memory_bytes: 26616