#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>

using namespace std;

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define REPO(i, n) for(int i = 1;i <= n;i++)
#define ll long long
#define INF 1999999999
#define MINF -1999999999
#define INF64 1999999999999999999
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007

bool dp[5100][41000];
ll n, ans = 0;

int main(){
	cin >> n;
	dp[0][0] = true;
	REP(i, n) {
		int a;
		cin >> a;
		REP(j, 40000) {
			if (dp[i][j]) {
				dp[i + 1][j] = true;
				dp[i + 1][j xor a] = true;
			}
		}
	}
	REP(i, 40000)if (dp[n][i]) ans++;
	cout << ans << endl;
}