#include <cstdio>
#include <iostream>
#include <algorithm>
#include <complex>
#include <queue>
#include <map>
#include <string>
using namespace std;

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define pb push_back
#define ALL(a) (a).begin(),(a).end()

#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)

#define PI 3.1415926535

typedef long long ll;
typedef pair<int, int> P;
//typedef complex<double> C;

const int MAX_N = 5000;
const int MAX = 1<<15;

int N;
int A[MAX_N];
bool dp[MAX_N + 1][MAX];

void input() {
	cin >> N;
	REP(i, N) cin >> A[i];
}

void solve() {
	REP(i, N) {
		REP(j, MAX) {
			dp[i][j] = false;
		}
	}
	dp[0][0] = true;

	REP(i, N) {
		REP(j, MAX) {
			dp[i+1][j ^ A[i]] |= dp[i][j];
			dp[i+1][j] |= dp[i][j];
		}
	}
	int cnt = 0;
	REP(j, MAX) {
		if (dp[N][j]) {
			cnt++;
		}
	}
	cout << cnt << endl;
}

int main() {
	input();
	solve();
}