#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;



int main(){
    int n;
    cin >> n;
    int A[n];
    for(int i = 0; i < n; ++i){
        cin >> A[i];
    }
    bool dp[n+1][50000];
    for(int i = 0; i < n+1; ++i){
        for(int j = 0; j < 50000; ++j){
            dp[i][j] = false;
        }
    }
    dp[0][0] = true;
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < 50000; ++j){
            if(!dp[i][j]) continue;
            dp[i+1][j] = true;
            dp[i+1][j^A[i]] = true;
        }
    }
    int cnt = 0;
    for(int j = 0; j < 50000; ++j){
        if(dp[n][j]) cnt++;
    }
    cout << cnt << endl;
    return 0;
}