#include <iostream>
#include <bitset>
using namespace std;

unsigned short i,j,N;
unsigned short A[5000];
const unsigned short M = 32768;
bitset<M> dp(1);

int main(void) {
	scanf("%d", &N);
	for(i = 0; i < N; i++) scanf("%d", &A[i]);
	
	for(i = 0; i < N; i++) for(j = 0; j < M; j++) if(dp.test(j)) dp.set(j ^ A[i]);
	
	printf("%d\n", dp.count());
	return 0;
}