#include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>

using namespace std;
const int lim = 1<<15;
bool dp[5001][lim+1];
int main(){
	memset(dp,0,sizeof(dp));
	int n;
	cin >> n;
	
	vector<int> a;
	for(int i = 0;i < n;i++){
		int ta;
		cin >> ta;
		if(find(a.begin(),a.end(),ta) == a.end()) a.push_back(ta);
	}
	
	dp[0][0] = true;
	for(int i = 0;i < a.size();i++){
		for(int j = 0;j <= lim;j++){
			if(dp[i][j]){
				dp[i+1][j] = true;
				dp[i+1][j ^ a[i]] = true;
			}
		}
	}
	
	int ans = 0;
	for(int i = 0;i <= lim;i++){
		if(dp[a.size()][i]) ans++;
	}
	
	cout << ans << endl;
	return 0;
}