#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;

int gcd(int a , int b){
	if(a < b)swap(a , b);
	if(a % b == 0)return b;
	else return gcd(b , a  % b);
}

int main(){
	int n;
	cin >> n;
	vector<ll> table(999999 , 0);
	table[0] = 1;
	ll x = 0;
	for(int i = 0; i < n; i++){
		ll a;
		cin >> a;
		table[a] = 1;
		x ^= a;
		table[x] = 1;
	}
	ll ans = 0;
	for(int i = 0; i < table.size(); i++){
		ans += table[i];
	}
	cout << ans << endl;

}