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

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

int main(void) {
  int n; scanf("%d", &n);
  vector<bool> dp(33333, false);
  dp[0] = true;
  vector<int> a(n);
  for(int i : range(n)) { scanf("%d", &a[i]); }
  for(int i : range(n)) {
    for(int j : range(33333)) {
      if(dp[j]) { dp[a[i] ^ j] = true; }
    }
  }
  int res = 0;
  for(int i : range(33333)) {
    if(dp[i]) { res++; }
  }
  printf("%d\n", res);
  return 0;
}