// Wrongri-La Shower

#include <cstdio>

bool can[5001][(1<<14)+1];

int main(){
    int N;
    scanf("%d", &N);

    int A[5000];
    for(int i=0;i<N;i++){
        scanf("%d", A+i);
    }

    can[0][0] = true;
    for(int i=0;i<N;i++){
        for(int j=0;j<=1<<14;j++){
            if(!can[i][j]){continue;}

            can[i+1][j] = true;
            can[i+1][j^A[i]] = true;
        }
    }

    int res = 0;
    for(int i=0;i<=1<<14;i++){
        res += can[N][i];
    }

    printf("%d\n", res);
}