#include <iostream>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <cstring>

using namespace std;

#define FOR(x,y) for(int x = 0;x < (y);x++)
#define LLI long long int
#define FORR(x,arr) for(auto& x:arr)
#define ALL(a) (a.begin()),(a.end())

#define _L(x) cout<<(x)<<endl
//#define _L(x) ;

template<int um> class UF {
public:
    vector<int> _parent,_rank;
    UF()
    {
        _parent=_rank=vector<int>(um,0);
        for(int i=0;i<um;i++)
        {
            _parent[i]=i;
        }
    }
    
    int Find(int x)
    {
        if(_parent[x] == x)
        {
            return x;
        }
        _parent[x] = Find(_parent[x]);
        return _parent[x];
    }
    
    int Union(int x,int y)
    {
        int xRoot = Find(x);
        int yRoot = Find(y);
        if(_rank[xRoot]>_rank[yRoot])
        {
            _parent[xRoot] = yRoot;
           return yRoot;
        }
        if(_rank[xRoot]<_rank[yRoot])
        {
            _parent[yRoot] = xRoot;
            return xRoot;
        }
        if(xRoot != yRoot)
        {
            _parent[yRoot] = xRoot;
            _rank[xRoot]++;
            return xRoot;
        }
        return xRoot;
    }
};

set<int> dp[5001];

int main() {
    int n;
    cin >> n;
    vector<int> data(n);
    FOR(i, n)
    {
        cin >> data[i];
    }
    
    dp[0].insert(0);
    for(int i = 0;i < n;i++)
    {
        dp[i + 1] = dp[i];
        auto c = data[i];
        for(auto ite = dp[i].begin(); ite != dp[i].end();ite++)
        {
            auto next = *ite ^ c;
            if(dp[i + 1].find(next) == dp[i + 1].end())
            {
                dp[i + 1].insert(next);
            }
        }
    }
    
    cout << dp[n].size() << endl;
    return 0;
    
}