#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <limits.h>
#include <time.h>
#include <string>
#include <string.h>
#include <sstream>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>

using namespace std;

typedef long long ll;

bool dp[16384+1];

int main(){
  int n;
  cin >> n;
  int a;
  int max_val = 0;
  dp[0] = true;

  for(int i = 0; i < n; i++){
    cin >> a;

    for(int j = max_val; j >= 0; j--){
      if(dp[j]){
        int v = j ^ a;
        max_val = max(max_val, v);
        dp[v] = true;
      }
    }
  }

  int answer = 0;

  for(int i = 0; i <= max_val; i++){
    if(dp[i]){
      answer++;
    }
  }

  cout << answer << endl;

  return 0;
}