#include<iostream>
using namespace std;

const int N = (1<<15);
bool dp[5001][N];

int main(){
    for(int i = 0; i < N; i++)  dp[0][i] = false;
    dp[0][0] = true;
    int n;
    cin >> n;
    
    int x;
    for(int j = 1; j <= n; j++){
        cin >> x;
        for(int i = 0; i < N; i++){
            if(dp[j-1][i]){
                dp[j][i] = true;
                dp[j][i^x] = true;
            }
        }
    }

    int count = 0;
    for(int i = 0; i < N; i++){
        if(dp[n][i])    count++;
    }

    cout << count << endl;
    return 0;
}