/* -*- coding: utf-8 -*-
 *
 * 183.cc: No.183 たのしい排他的論理和(EASY) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 5000;
const int MAX_AB = 15;
const int ABITS = 1 << MAX_AB;

/* typedef */

/* global variables */

int as[MAX_N];
bool dp[2][ABITS];

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> as[i];

  int cur = 0, nxt = 1;
  dp[cur][0] = true;

  for (int i = 0; i < n; i++) {
    memcpy(dp[nxt], dp[cur], sizeof(dp[cur]));
    for (int bits = 0; bits < ABITS; bits++)
      if (dp[cur][bits]) dp[nxt][bits ^ as[i]] = true;
    cur ^= 1, nxt ^= 1;
  }

  int cnt = 0;
  for (int bits = 0; bits < ABITS; bits++)
    if (dp[cur][bits]) cnt++;

  printf("%d\n", cnt);
  return 0;
}