#include<bits/stdc++.h>
#ifdef xay5421
#define D(...) fprintf(stderr,__VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ "="),debug_helper::debug(__VA_ARGS__),D("\n")
#include"/home/xay5421/debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define each(x,v) for(auto&x:v)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
template<class T>void rd(T&x){int f=0,c;while(!isdigit(c=getchar()))f^=!(c^45);x=(c&15);while(isdigit(c=getchar()))x=x*10+(c&15);if(f)x=-x;}
template<class T>void pt(T x,int c=-1){if(x<0)putchar('-'),x=-x;if(x>9)pt(x/10);putchar(x%10+48);if(c!=-1)putchar(c);}
using namespace std;
using LL=long long;
using ULL=unsigned long long;
const int N=200005;
int n;
LL a[N],b[N],w[40];
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	rd(n);
	LL zero=0;
	rep(i,1,n)rd(a[i]),zero&=a[i];
	rep(i,1,n)a[i]^=zero;
	vector<pair<LL,int> >v;
	rep(bit,0,39){
		w[bit]=(1LL<<40)-1;
		int tt=0;
		rep(i,1,n)if(a[i]>>bit&1){
			w[bit]&=a[i];
			++tt;
		}
		if(tt){
			v.eb(w[bit],bit);
		}
	}
	sort(v.begin(),v.end());
	vector<int>V;
	for(int i=0,j;i<SZ(v);i=j){
		j=i+1;
		while(j<SZ(v)&&v[i].first==v[j].first)++j;
		V.pb(v[i].second);
	}
	vector<vector<int> >e(SZ(V));
	vector<int>deg(SZ(V));
	rep(i,0,SZ(V)-1)rep(j,0,SZ(V)-1)if(i!=j&&(w[V[j]]>>V[i]&1)){
		e[i].pb(j);
		++deg[j];
	}
	queue<int>que;
	rep(i,0,SZ(V)-1)if(!deg[i])que.push(i);
	vector<int>ord;
	while(!que.empty()){
		int u=que.front();
		que.pop();
		ord.pb(u);
		for(auto&x:e[u])if(!--deg[x])que.push(x);
	}
	
	rep(i,0,SZ(ord)-1){
		rep(j,0,SZ(ord)-1)if(w[ord[i]]>>ord[j]&1){
			assert(j<=i);
			b[ord[i]]|=1LL<<j;
		}
	}
	int C=SZ(ord)/2;
	vector<int>f(1<<C);
	rep(i,0,(1<<C)-1){
		LL st=0;
		rep(j,0,C-1){
			if(i>>j&1){
				st|=b[ord[j]];
			}
		}
		f[st]=1;
	}
	for(int i=1;i<(1<<C);i<<=1)for(int j=0;j<(1<<C);j+=i<<1)for(int k=0;k<i;++k)f[j+k]+=f[i+j+k];
	LL ans=0;
	rep(i,0,(1<<(SZ(ord)-C))-1){
		LL st=0;
		rep(j,0,SZ(ord)-C-1){
			if(i>>j&1){
				st|=b[ord[j+C]];
			}
		}
		if((st>>C)==i){
			ans+=f[st&((1<<C)-1)];
		}
	}
	printf("%lld\n",ans);
	return 0;
}