#include <iostream>
#include <unordered_set>
using namespace std;
int main()
{
    int n;
    while (cin>>n) {
        unordered_set<int> dp;
        dp.insert(0);
        while (n--) {
            auto next=dp;
            int a; cin>>a;
            for(int v: dp) next.insert(a^v);
            dp=next;
        }
        cout<<dp.size()<<endl;
    }
}