#include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;


int main(){
    int n, MAX = 1 << 15, cnt = 0;
    cin >> n;
    vector<int> dp(MAX);
    dp[0] = 1;
    for (int i = 0; i < n; i++){
        int tmp;
        cin >> tmp;
        for (int j = 0; j < MAX; j++){
            if (dp[j]) dp[j ^ tmp] = 1;
        }
    }
    for (auto x : dp) if (x) cnt++;
    cout << cnt << endl;
}