#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<25;
typedef pair<int,int> P;
typedef long long ll;
typedef unsigned long long ull;

int b[2][1<<14];

int main(){
	int n;
	cin>>n;
	b[0][0] = 1;
	for(int i = 0; i < n; i++){
		int a;
		cin>>a;
		for(int j = 0; j < 1<<14; j++) b[!(i&1)][a^j] |= b[i&1][j];
	}
	int res = 0;
	for(int i = 0; i < 1<<14; i++) res += b[n&1][i];
	cout<<res<<endl;
	return 0;
}