#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>

using namespace std;

int main() {
	int n, in;

	cin >> n;
	set<int> a;
	a.insert(0);
	for (int i = 0; i < n; i++) {
		cin >> in;
		if (a.count(in) > 0) {
			continue;
		}
		for (auto it = a.begin(); it != a.end(); it++) {
			a.insert(*it ^ in);
		}
	}

	cout << a.size() << endl;
	return 0;
}