#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
#include <iomanip>
#include <cmath>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL<<60

// xor
int XOR(int a, int b) {
	int res = 0;
	int dig = 1;
	while ((a > 0) || (b > 0)) {
		int tmpa = a % 2;
		int tmpb = b % 2;
		if (tmpa != tmpb) res += dig;
		dig *= 2;
		a /= 2; b /= 2;
	}
	return res;
}

bool poss[5009][20009];
int A[5009];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N; cin >> N;
	for (int i = 1; i <= N; i++) cin >> A[i];
	//cout << "ok1" << endl;
	//cout << XOR(1, 2) << endl;

	poss[0][0] = true;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j <= 16384; j++) {
			if (poss[i][j]) {
				poss[i + 1][j] = true;
				int nxt = XOR(j,A[i+1]);
				if (nxt <= 16384) poss[i + 1][nxt] = true;
			}
		}
	}

	//cout << "ok2" << endl;

	int ans = 0;
	for (int j = 0; j <= 20000; j++) {
		if (poss[N][j]) ans++;
	}
	cout << ans << endl;

	return 0;
}