#include <bits/stdc++.h>

using namespace std;

int n;
int input[100];
map<pair<int, long long>, long long>dp;

int solve(int indx, int x) {

	if(indx == n) {
		if(x == 0)
			return 1;
		return 0;
	}
	pair<int, long long> p(indx, x);
	if(dp.find(p) != dp.end())
		return dp[p];

	int ans = solve(indx + 1, x ^ input[indx]);
	int sum = input[indx];
	for(int i = indx + 1; i < n; i++) {
		sum += input[i];
		ans += solve(i + 1, sum ^ x);
	}

	dp[p] = ans;
	return ans;
}


int main(int argc, char **argv) {

//	ios_base::sync_with_stdio(0);

	//freopen("input.txt","r", stdin);
	cin>>n;
	for(int i = 0;i < n; i++) {
		cin>>input[i];
	}


	cout<<solve(0, 0)<<endl;
    return 0;
}