#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define whole(f,x,...) ([&](decltype((x)) y) { return (f)(begin(y), end(y), ## __VA_ARGS__); })(x)
using namespace std;
const int l = 15;
int main() {
    int n; cin >> n;
    vector<int> as(n); repeat (i,n) cin >> as[i];
    array<bool,(1<<l)> cur = {};
    array<bool,(1<<l)> prv = {};
    cur[0] = true;
    for (int a : as) {
        cur.swap(prv);
        repeat (i,1<<l) if (prv[i]) {
            cur[i  ] = true;
            cur[i^a] = true;
        }
    }
    int ans = whole(count, cur, true);
    cout << ans << endl;
    return 0;
}