#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int N;
    set<ll> S;

    cin >> N;

    while (N--) {
        ll A;
        cin >> A;
        auto it = S.rbegin();
        while (it != S.rend()) {
            A = min(A, A ^ *it);
            it++;
        }
        S.insert(A);
    }
    S.erase(0ll);
    cout << (1ll << (S.size())) << endl;
}