#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;cin >> n;
    vector<int> a(n);
    REP(i,n){
        cin >> a[i];
    }
    vector<vector<bool>> dp(2,vector<bool>(1<<15));
    dp[0][0]=true;
    REP(i,n){
        REP(j,1<<15){
            if(!dp[i%2][j]){
                continue;
            }
            dp[(i+1)%2][j]=true;
            dp[(i+2)%2][(j^a[i])]=true;
        }
    }
    int ans=0;
    REP(i,1<<15){
        if(dp[n%2][i]){
            ans++;
        }
    }
    cout << ans << endl;
}