#include <stdlib.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#define rep(i,n)	for(int i=0;i<n;i++)
#define srep(i,a,n)	for(int i=a;i<n;i++)
#define REP(i,n)	for(int i=0;i<=n;i++)
#define SREP(i,a,n)	for(int i=a;i<=n;i++)
#define rrep(i,n)	for(int i=n-1;i>=0;i--)
#define RREP(i,n)	for(int i=n;i>=0;i--)
#define scan(x) cin >> x
#define print(x) cout << x << endl
#define fastcin {\
    cin.tie(0);\
    ios::sync_with_stdio(false);\
}
using namespace std;
typedef long long ll;
/* Coding Space */
int max_num;
int N;
int A[5001];
bool** dp;
int main(void) {
	fastcin;
	scan(N);
	SREP(n, 1, N) scan(A[n]);
	REP(n, 14) max_num += 1 << n;
	REP(n, N) {
		dp = new bool*[n + 1];
		REP(m, N) dp[n][m] = new bool[max_num];
	}
	dp[0][0] = true;
	SREP(n, 1, N) rep(a, 16385) {
		if (!dp[n - 1][a]) continue;
		dp[n][a] = true;
		dp[n][a ^ A[n]] = true;
	}
	print(count(dp[N], dp[N] + 16385, true));
	return 0;
}