#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main(){
    
    int n, x, ans;
    const int s = pow(2, 15);
    bool number[s];
    fill(number, number + s, false);
    number[0] = true;
    
    cin >> n;
    rep(i, n){
        cin >> x;
        rep(j, s)
            number[j^x] |= number[j];
    }
    
    ans = 0;
    rep(i, s)
        if(number[i])
            ans++;
    cout << ans << endl;
    return 0;
}