#include <iostream>
#include <vector>
#include <bitset>
using namespace std;
typedef long long ll;

// binary行列の掃き出し法と行列累乗
// bitset高速化により、定数倍速い

const int MAX_ROW = 100005;
const int MAX_COL = 70;
struct BitMatrix {
    int H, W;
    bitset<MAX_COL> val[MAX_ROW];
    BitMatrix(int m, int n) : H(m), W(n) {}
    inline bitset<MAX_COL> & operator [] (int i) { return val[i]; }
};
inline BitMatrix operator * (BitMatrix A, BitMatrix B) {
    BitMatrix R(A.H, B.W);
    BitMatrix tB(B.W, B.H);
    for (int i = 0; i < tB.H; i++) for (int j = 0; j < tB.W; j++) tB[i][j] = B[j][i];
    for (int i = 0; i < R.H; i++) for (int j = 0; j < R.W; j++) R[i][j] = ((A[i] & tB[j]).count() & 1);
    return R;
}
inline BitMatrix pow(BitMatrix A, ll  n) {
    BitMatrix R(A.H, A.H);
    for (int i = 0; i < A.H; ++i) R[i][i] = 1;
    while (n > 0) { if (n & 1) R = R * A; A = A * A; n >>= 1; }
    return R;
}
int GaussJordan(BitMatrix &A, bool is_extended = false) {
    int rank = 0;
    for (int col = 0; col < A.W; col++) {
        if (is_extended && col == A.W - 1) break; // 拡大係数行列。この場合、最後の列は掃き出さない
        int pivot = -1;
        for (int row = rank; row < A.H; row++) if (A[row][col]) { pivot = row; break; }
        if (pivot == -1) continue;
        swap(A[pivot], A[rank]);
        for (int row = 0; row < A.H; row++) if (row != rank && A[row][col]) A[row] ^= A[rank];
        rank++;
    }
    return rank;
}
int linear_equation(BitMatrix A, vector<int> b, vector<int> &res) {
    int m = A.H, n = A.W;
    BitMatrix M(m, n + 1);
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) M[i][j] = A[i][j];
        M[i][n] = b[i];
    }
    int rank = GaussJordan(M, true);
    for (int row = rank; row < m; row++) if (M[row][n]) return -1; // check if it has no solution
    res.assign(n, 0);
    for (int i = 0; i < rank; i++) res[i] = M[i][n];
    return rank;
}


// verified
//  https://atcoder.jp/contests/code-thanks-festival-2017/tasks/code_thanks_festival_2017_f
ll pow_mod(ll num, ll pow, ll mod) {
    ll prod = 1;
    num %= mod;
    while (pow > 0) { if (pow & 1) prod = prod * num % mod; num = num * num % mod; pow >>= 1; }
    return prod;
}
void AtCoder_2017_12_2_F() {
    int n, k, a;
    cin >> n >> k;
    vector <int> b(20);
    for (int j = 0; j < 20; j++) if ((1 << j) & k) b[j] = 1;
    BitMatrix A(20, n);
    for (int i = 0; i < n; i++) {
        cin >> a;
        for (int j = 0; j < 20; j++) if ((1 << j) & a) A[j][i] = 1;
    }
    vector <int> res;
    int rank = linear_equation(A, b, res);
    cout << (rank == -1 ? 0 : pow_mod(2, n - rank, 1e9+7)) << '\n';
}


// verified
//  https://yukicoder.me/problems/no/184
void yuki184() {
    int n; cin >> n;
    BitMatrix M(n, 61);
    for (int i = 0; i < n; i++) {
        ll a; cin >> a;
        for (int j = 0; j < 61; j++) if (a & (1LL << j)) M[i][j] = 1;
    }
    int rank = GaussJordan(M);
    ll ans = 1LL;
    while (rank--) ans *= 2LL;
    cout << ans << '\n';
}

int main() {
    // AtCoder_2017_12_2_F();
    yuki184();
    return 0;
}