#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define dump(x)  cerr << #x << " => " << (x) << endl;
#define dump1d_arr(array,i) cerr << #array << "[" << (i) << "] ==> " << (array[i]) << endl;
#define dump2d_arr(array,i,j) cerr << #array << "[" << (i) << "]" << "[" << (j) << "] ==> " << (array[i][j]) << endl;
#define loINF (long)10000000000
#define shINF (short)10000
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define CLR(a) memset((a), 0 ,sizeof(a))
using namespace std;

typedef vector<long> Vl;
typedef vector<short> VS;

int main(void){
	short N;
	Vl A(N,0);
	long tmpmax = 0;
	long maxval = 0;
	short iter = 0;

	cin >> N;

	REP(i,N){
		cin >> A[i];
		tmpmax = MAX(A[i],tmpmax);
	}

	#ifdef DEBUG
		REP(i,N) dump1d_arr(A,i);
	#endif

	
	while(tmpmax > maxval){
		maxval += (1 << (iter++));
	}

	#ifdef DEBUG
		dump(maxval);
	#endif

	VS initdp(maxval+1,0);
	VS dp_tmp(maxval+1,0);
	VS dp(maxval+1,0);
	dp[0] = 1;

	REP(i,N){
		dp_tmp = initdp;
		REP(j,maxval+1){
			#ifdef DEBUG
				dump(i);
				dump(j);
			#endif

			if (dp[j]){
				dp_tmp[j^(A[i])] = 1;
				dp_tmp[j] = 1;
			}
		}
		dp = dp_tmp;
	}

	#ifdef DEBUG
		REP(i,dp.size()) dump1d_arr(dp,i);
	#endif //(DEBUG)

	cout << count(dp.begin(),dp.end(),1) << endl;

	return 0;
}