#include <numeric>
#include <queue>
#define REP(i,n) for(int i=0; i<(int)(n); i++)

#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }

#include <set>

using namespace std;

int dp[1 << 15];

int main(){
  const int n = getInt();
  dp[0] = 1;
  REP(i,n){
    const int a = getInt();
    REP(j,1<<15) if(dp[j])
      dp[j ^ a] = 1;
  }
  printf("%d\n", accumulate(dp, dp + (1 << 15), 0));
  return 0;
}