#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define sz(a) ((int) (a).size())
#define ll long long 
#define vi vectoe<int>
#define pb emplace_back
using namespace std;
const int N = 1 << 19, mod = 1e8 + 7;
int n;
int a[N];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	L(i, 1, n) cin >> a[i];
	set<int>ans;
	L(i, 1, n) ans.insert(a[i]);
	L(i, 1, n - 1) {
		int v[3] = {0, 0, 0};
		v[0] = a[i] ^ a[i + 1];
		v[1] = a[i] ^ v[0];
		v[2] = a[i] ^ v[1];
		L(s, 0, (1 << 3) - 1) {
			int val = 0;
			L(j, 0, 2) if(s >> j & 1)val ^= v[j];
			ans.insert(val);
		}
	}
	cout << sz(ans) << '\n';
	return 0;
}