#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <algorithm>
#include <cmath>

#include <string>
#include <list>
#include <queue>
#include <vector>
#include <complex>

/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) std::cout<<(p)<<std::endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
const int dpMax = 16384*2;
bool dp1[dpMax];
bool dp2[dpMax];

int main(void){
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(6);//
	
	int N;
	cin>>N;
	int A[5000];
	rep(i,N)cin>>A[i];
	sort(A,A+N);

	rep(i,dpMax){
		dp1[i] = false;
		dp2[i] = false;
	}

	dp1[0] = true;
	dp2[0] = true;

	for(int m=0;m<N;++m){
		for(int i = dpMax-1;i>=0;--i){
			if(dp1[i] == true){
				dp2[ i^A[m] ] = true;
			}
		}
		for(int i=0;i<dpMax;++i){
			dp1[i] = dp2[i];//ha-
		}
	}

	int ans=0;
	for(int i=0;i<dpMax;++i){
		if(dp1[i] == true){
			++ans;
		}
	}
	P(ans);
	return 0;
}