#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 9;

int N;
ll A[100000];

int main() {
    cin >> N;
    rep (i, N) cin >> A[i];

    rep (j, 64) {
        int k = -1;
        rep2 (i, j, N) {
            if (A[i] >> j & 1) {
                k = i;
                break;
            }
        }

        if (k == -1) continue;

        swap(A[j], A[k]);

        rep (i, N) if (i != j) {
            if (A[i] >> j & 1) A[i] ^= A[j];
        }
    }

    int num = 0;
    rep (i, N) {
        if (A[i] != 0) num++;
    }

    cout << (1ll << num) << endl;
}