#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using treap = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define REP(i, n) for (long long i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (long long i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) begin(obj), end(obj)
#define RALL(obj) rbegin(obj), rend(obj)
#define fi first
#define se second
using ii = pair<int, int>;
vector<ii> dirs = {
    {1, 0}, {0, 1}, {-1, 0}, {0, -1},  // 4方向
    {1, 1}, {-1, 1}, {-1, -1}, {1, -1},  // 斜め
    {0, 0},  // 自身
};
template <class T> inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
template <class T> inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <class T, class S> vector<T> make_vec(size_t n, S x) { return vector<T>(n, x); }
template <class T, class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(n, make_vec<T>(ts...)); }

// debug
template <class T> ostream& operator<<(ostream& s, vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream& s, vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream& s, pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T> ostream& operator<<(ostream& s, set<T> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T> ostream& operator<<(ostream& s, multiset<T> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
template <class T, class S> ostream& operator<<(ostream& s, unordered_map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
    #define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
    #define dump(...)
    #define endl "\n"
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }

struct Fast { Fast() { cin.tie(nullptr); ios::sync_with_stdio(false); } } fast;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
constexpr int MOD = 1000000007;
// *************** TEMPLATE END *************** 

constexpr int K = 63;
template <class T>
void gauss_jordan(vector<vector<T>>& A) {
    int n = A.size(), m = A[0].size();
    vector<bool> used(n);
    for (int col = 0; col < m - 1; col++) {
        int pivot = -1;
        for (int row = 0; row < n; row++) {
            if (!used[row] && A[row][col]) {
                pivot = row;
                break;
            }
        }
        if (pivot == -1) continue;
        used[pivot] = true;
        for (int row = 0; row < n; row++) {
            if (row == pivot) continue;
            T d = A[row][col] / A[pivot][col]; // 倍率
            for (int col2 = 0; col2 < m; col2++) {
                A[row][col2] -= A[pivot][col2] * d;
                A[row][col2] += 2;
                A[row][col2] %= 2;
            }
        }
    }
}
signed main() {
    int n; cin >> n;
    vector<int> a(n); REP (i, n) cin >> a[i];
    int ans = 0;
    vector<vector<int>> b(K, vector<int>(n + 1));
    REP (k, K) {
        b[k][n] = 1;
        int cnt = 0;
        REP (i, n) {
            if (a[i] & 1LL << k) cnt++;
        }
        if (cnt % 2) {
            ans += 1LL << k;
        } else {
            REP (i, n) {
                if (a[i] & 1LL << k) b[k][i] = 1;
            }
        }
    }
    reverse(ALL(b));
    gauss_jordan(b);
    reverse(ALL(b));
    REP (k, K) {
        bool ok = false;
        if (b[k][n] == 0) ok = true;
        REP (i, n) {
            if (b[k][i]) ok = true;
        }
        if (ok) ans += 1LL << (k + 1);
    }
    cout << ans << endl;
}


Measured memory_bytes: 51200