#include <bits/stdc++.h>
using namespace std;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FORR(x,arr) for(auto&& x:arr)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define BIT(n) (1LL<<(n))
#define SZ(x) ((int)(x).size())
typedef long long ll;
// -------------------------------------

template<class T> inline bool amax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }

int N;
bool dp[2][32769];

void Main() {
  cin >> N;
  vector<int> A(N);
  REP(i, N) cin >> A[i];
  
  sort(ALL(A));
  A.erase(unique(A.begin(), A.end()), A.end());
  N = SZ(A);

  dp[1][0] = 1;
  int ma = 0;

  REP(i, N) {
    int c = i % 2;
    int p = !c;
    REP(j, ma+1) {
      if (dp[p][j]) {
        dp[c][j ^ A[i]] |= dp[p][j];
        amax(ma, j ^ A[i]);
        dp[c][j] |= dp[p][j];
      }
    }
  }
  int ans = 0;
  REP(j, ma+1) {
    if (dp[!(N%2)][j]) ans++;
  }
  cout << ans << endl;
}
int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }