//#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;

int main() {
	ll N;
	cin >> N;
	vll A(N);
	rep(i, N)cin >> A[i];

	vector<vector<bool>> DP(N + 1, vector<bool>(32800, false));
	DP[0][0] = true;

	rep(i, N) {
		rep(k, 32800) {
			if (DP[i][k]) {
				DP[i + 1][k] = true;
				DP[i + 1][k ^ A[i]] = true;
			}
		}
	}
	ll an = 0;
	rep(k, 32800) {
		if (DP[N][k])an++;
	}
	cout << an << endl;



}