// created:  2024-09-09 19:11:33
#include<cstdio>
#include<cctype>
#include<cstring>
#include<algorithm>
#include<functional>
#define F(i,l,r) for(int i=(l),i##_end=(r);i<i##_end;++i)
#define I128 //||is_same<T,__int128_t>::value||is_same<T,__uint128_t>::value
using namespace std;
template<typename T>enable_if_t<is_integral<T>::value I128,void> readmain(T &x)
{
	bool neg=false;int c=getchar();
	for(;!isdigit(c);c=getchar())if(c=='-')neg=true;
	for(x=0;isdigit(c);c=getchar())x=(T)(10*x+(c-'0'));
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
typedef unsigned long long ull;
constexpr int N=45,NN=(1<<20)+5;
int m,n=40,d[N],h,q;
ull a[N],c[N],e[NN],f[NN],g[NN];
int main()
{
	read(m);
	F(i,0,n)a[i]=-1;
	F(i,0,m)
	{
		ull b;read(b);
		F(j,0,n)if(b>>j&1)a[j]&=b;
	}
	sort(a,a+n,greater<ull>());
	m=0;
	F(i,0,n)
	{
		if(~a[i]&&(!i||a[i]!=a[i-1]))d[i]=m++;
		else d[i]=-1;
	}
	F(i,0,n)if(~d[i])F(j,i,n)if(~d[j]&&((a[i]&a[j])==a[j]))c[d[i]]|=1ull<<d[j];
	F(i,0,n=m)a[i]=c[i];
	h=min(n>>1,20);
	e[q++]=0;
	F(i,0,h)F(j,0,q)if(~e[j]>>i&1)e[q++]=e[j]|c[i];
	F(i,0,q)++f[e[i]>>h];
	F(i,h,n)
	{
		e[i]>>=i+1;
		F(j,0,1<<(n-i-1))g[j]+=f[2*j]+f[2*j+1],g[j|e[i]]+=f[2*j];
		memcpy(f,g,sizeof(ull)<<(n-i-1));
		memset(g,0,sizeof(ull)<<(n-i-1));
	}
	printf("%llu\n",f[0]);
	return 0;
}