#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int A[5100];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int N;
    std::cin >> N;

    for(int i=0;i<N;++i){
        std::cin >> A[i];
    }

    int rank = 0;
    for(int i=0;i<=min(14, N-1);++i){
        int nz = -1;
        for(int j=i;j<N;++j){
            if(A[j] >> i & 1){
                nz = j;
                break;
            }
        }

        if(nz == -1){continue;}
        
        if(nz != i){
            swap(A[i], A[nz]);
        }

        for(int j=i+1;j<N;++j){
            A[j] ^= A[i];
        }

        ++rank;        
    }

    std::cout << (1 << rank) << std::endl;
}