#include <bits/stdc++.h>

#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;

const int MAXN = 100100;
ll A[MAXN];

typedef long long number;
typedef vector<number> vec;
typedef vector<vec> matrix;

int matRank(matrix A) {
    const int n = A.size(), m = A[0].size();
    int r = 0;
    for (int i = 0; r < n && i < m; ++i) {
        int pivot = r;
        for (int j = r+1; j < n; ++j)
            if (abs(A[j][i]) > abs(A[pivot][i])) pivot = j;
        swap(A[pivot], A[r]);
        if (abs(A[r][i]) <= 0) continue;
        for (int k = m-1; k >= i; --k)
            A[r][k] /= A[r][i];
        for(int j = r+1; j < n; ++j)
            for(int k = i; k < m; ++k)
                A[j][k] -= A[r][k] * A[j][i];
        ++r;
    }
    return r;
}

ll pp(int num) {
    ll ret = 1;
    for (int i = 0; i < num; i++) ret *= 2;
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    matrix mat(N, vector<number>(64));
    for (int i = 0; i < N; i++) {
        cin >> A[i];
        for (int j = 0; j < 64; j++) {
            mat[i][j] = A[i]&1;
            A[i] /= 2;
        }
    }
    cout << pp(matRank(mat)) << endl;
    return 0;
}