#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    const ll mv = 32768;
    ll n;
    cin >> n;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
    vector<vector<bool>> dp(2, vector<bool>(mv + 1, false));
    dp[0][0] = true;
    rep(i, n) {
        fill(all(dp[(i + 1) % 2]), false);
        rep(j, mv + 1) {
            if (!dp[i % 2][j]) continue;
            dp[(i + 1) % 2][j] = true;
            ll v = j ^ a[i];
            if (v > mv) continue;
            dp[(i + 1) % 2][v] = true;
        }
    }
    ll ans = 0;
    rep(i, mv + 1) {
        if (dp[n % 2][i]) ans++;
    }
    cout << ans << endl;
    return 0;
}