#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int n;
int a[5000];
bool dp[2][1<<15];

int main() {
	cin >> n;
	REP(i, n) scanf("%d", a + i);
	
	dp[0][0] = true;
	
	REP(i, n) {
		int now = i % 2;
		int next = !now;
		
		fill(dp[next], dp[next + 1], false);
		
		for (int j = (1<<15) - 1; j >= 0; j--) {
			dp[next][j] |= dp[now][j];
			dp[next][j ^ a[i]] |= dp[now][j];
		}
	}
	
	int ans = 0;
	REP(i, 1<<15) if (dp[n % 2][i]) ans++;
	cout << ans << endl;
	
	return 0;
}