#include <bits/stdc++.h>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;

const int N = 3e5 + 500;

int A[N];

int main() {
	set < int > S;
	int n; scanf("%d", &n);
	vi svi = {0};
	for(int i = 0;i < n;i++) {
		scanf("%d", A + i);
		svi.PB(A[i]);
		if(i) svi.PB(A[i - 1] ^ A[i]);
	}
	sort(svi.begin(), svi.end());
	svi.erase(unique(svi.begin(), svi.end()), svi.end());
	printf("%d\n", (int)svi.size());
	return 0;
}