#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;

template<class T> void vin(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
}

int dp[5010][40000];
int N;
int A[5010];

bitset<40000> used;

int solve(int idx, int xor_sum) {
    int& res = dp[idx][xor_sum];
    if (~res) return res;
    if (idx >= N) {
        used[xor_sum] = 1;
        res = 1;
    }
    else {
        res = max(solve(idx+1, xor_sum), solve(idx+1, xor_sum xor A[idx]));
    }
    return res;
}

int main() {
    cin >> N;
    rep(i, N) cin >> A[i];
    rep(i, N) rep(j, 40000) dp[i][j] = -1;
    fill(dp[0], dp[5001], -1);
    solve(0, 0);
    cout << used.count() << endl;
    return 0;
}