#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <utility>
using namespace std;

typedef pair<int, int> P;
typedef unsigned long long ll;

#define For(i, a, b) for(int i = (a); i < (b); i++)
#define Rep(i, n) For(i, 0, (n))

const int inf = 999999999;
const int mod = 1000000007;

bool dp[5010][1 << 15];

int main(){
	int n; cin >> n;
	int a[n];
	Rep(i, n) cin >> a[i];
	dp[0][0] = true;
	Rep(i, n) Rep(j, 1 << 15){
		if((j ^ a[i]) >= 0){
			if(dp[i][j ^ a[i]] || dp[i][j]) dp[i + 1][j] = true;
		}else{
			if(dp[i][j]) dp[i + 1][j] = true;
		}
	}
	int ans = 0;
	Rep(j, 1 << 15){
		if(dp[n][j]) ans += 1;
	}
	cout << ans << endl;
	return 0;
}