#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int main() {
    int n;
    cin >> n;

    vector<int> a(n);
    rep(i,n) cin >> a[i];

    vector<int> v;
    v.push_back(0);
    
    rep(i,n) {
        vector<int> t(v.begin(),v.end());
        rep(j,t.size()) {
            int tmp = t[j];
            tmp ^= a[i];
    
            v.push_back(tmp);
        }
    }

    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());

    cout << v.size() << endl;

    return 0;
}