#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    int a[n];
    rep(i,n)cin >> a[i];
    
    bitset<80000> dp(0), dp2(0);
    dp[0] = 1;
    rep(i,n){
        dp2 = dp;
        rep(j,40000){
            if(dp[j])dp2[j^a[i]] = 1;
        }
        dp = dp2;
    }
    int ans = 0;
    rep(i,40000)ans += dp[i];
    cout << ans << endl;
    return 0;
}