#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    const int MAX = (1 << 14) * 2 - 1;
    int n; cin >> n;
    vector<int> a(n);
    for (int &ai: a) cin >> ai;
    vector<int> cur(MAX + 1, 0), nxt(MAX + 1, 0);
    cur[0] = 1;
    for (int ai: a) {
        for (int i = 0; i <= MAX; i++) nxt[i] = cur[i ^ ai] | cur[i];
        swap(cur, nxt);
    }
    int ans = 0;
    for (int i = 0; i <= MAX; i++) if (cur[i]) ans++;
    cout << ans << endl;
    return 0;
}