#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
const ll inf = 1LL << 50;
const ll MOD = 1e9 + 7;
struct edge { ll from; ll to; ll cost; };




int main(){
	int n;
	cin >> n;

	vector<int>a(n);
	rep(i, 0, n) {
		cin >> a[i];
	}


	vector<int>is_able(40000);
	is_able[0] = 1;
	rep(i, 0, n) {
		rep(j, 0, 40000) {
			if (is_able[j])is_able[j^a[i]] = 1;
		}
	}

	int ans = 0;
	rep(i, 0, 40000) {
		ans += is_able[i];
	}

	cout << ans << endl;

	return 0;
}