#include <iostream>
#include <algorithm>
#include <set>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

int N; int A[5001]; bool dp[2][1<<15];

int main() {

  cin >> N; rep(i, N) cin >> A[i];

  dp[0][0] = 1;
  rep(i, N) {
    rep(j, 1<<15) {
      dp[(i+1)&1][j] = dp[(i+1)&1][j] || dp[i][j^A[i]];
    }
    rep(j, 1<<15) {
      dp[(i+1)&1][j] = dp[(i+1)&1][j] || dp[i][j];
    }
  }

  int ans = 0;
  rep(i, 1<<15) ans += dp[N&1][i];
  cout << ans << endl;

  return 0;
}