#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <tuple>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int n;
ll a[100010];

const int N = 100010;
int bitset_rank(vector<bitset<N> >& b) {
    int l = b.size(), h = N-1;
    for (int i = 0; i < l; i++) {
        while (h >= 0) {
            bool f = false;
            for (int j = i; j < l; j++) {
                if (b[j][h]) {
                    swap(b[i], b[j]);
                    f = true;
                    break;
                }
            }
            if (f) break;
            h--;
        }
        if (h < 0) return i;
        for (int j = i+1; j < l; j++) {
            if (b[j][h]) b[j] ^= b[i];
            else break;
        }
    }
    return l;
}

ll solve() {
    vector<bitset<N> > vec;
    for (int i = 0; i <= 60; i++) {
        bitset<N> b;
        for (int j = 0; j < n; j++) {
            b.set(j, (a[j] >> i) & 1);
        }
        vec.push_back(b);
    }
    return 1LL << bitset_rank(vec);
}

void input() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}