#include <cstdio>
#include <algorithm>

typedef long long ll;

int N;
ll A[100000];

int main(){
    scanf("%d", &N);
    for(int i=0;i<N;i++){
        scanf("%lld", A+i);
    }
    
    for(int i=0;i<60;i++){
        {
            int j;
            for(j=0;j<N;j++){
                if(A[j] >> i & 1){break;}
            }

            if(j == N){continue;}

            std::swap(A[j], A[i]);
        }

        for(int j=0;j<N;j++){
            if(j == i){continue;}
            if(!(A[j] >> i & 1)){continue;}
            A[j] ^= A[i];
        }
    }

    int res = 0;
    for(int i=0;i<N;i++){
        if(A[i] > 0){++res;}
    }

    printf("%lld\n", 1ll << res);
}