#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
int cnt,V[50],save[50][50],now[50],n;
LL ans;
vector<int>g[50][2];
bool vis[50][50][2][2],vi[50][2],lk[50],ok[50];
map<LL,LL>f[50];
LL dfs(int p)
{
    if(p>cnt)return 1;
    int x=V[p];
    if(now[x]!=-1)return dfs(p+1);
    if(g[x][0].size()==0&&g[x][1].size()==0)return dfs(p+1)*2;
    LL msk=0;
    for(int i=p;i<=cnt;i++)msk=msk*3+(now[V[i]]+1);
    if(f[p].contains(msk))return f[p][msk];
    LL&res=f[p][msk];
    res=0;
    bool flag=1;
    now[x]=0;
    int tcnt=0;
    for(auto y:g[x][0])
    {
        if(now[y]==1){flag=0;break;}
        if(now[y]==-1)now[y]=0,save[p][++tcnt]=y;
    }
    if(flag)res+=dfs(p+1);
    rep(i,tcnt)now[save[p][i]]=-1;
    now[x]=1;
    tcnt=0;flag=1;
    for(auto y:g[x][1])
    {
        if(now[y]==0){flag=0;break;}
        if(now[y]==-1)now[y]=1,save[p][++tcnt]=y;
    }
    if(flag)res+=dfs(p+1);
    rep(i,tcnt)now[save[p][i]]=-1;
    now[x]=-1;
    return res;
}
int main()
{
    scanf("%d",&n);
    rep(i,n)
    {
        LL x;
        scanf("%lld",&x);
        for(int j=0;j<40;j++)ok[j]=(x>>j)&1;
        for(int j=0;j<40;j++)for(int k=0;k<40;k++)vis[j][k][ok[j]][ok[k]]=1;
        for(int j=0;j<40;j++)vi[j][ok[j]]=1;
    }
    LL C=1;
    for(int i=0;i<40;i++)
    {
        if(!vi[i][0]||!vi[i][1])continue;
        for(int j=i+1;j<40;j++)if(!vis[i][j][0][1])g[i][0].pb(j),lk[i]=lk[j]=1;
        for(int j=i+1;j<40;j++)if(!vis[i][j][1][0])g[i][1].pb(j),lk[i]=lk[j]=1;
        if(!lk[i])C*=2;else V[++cnt]=i;
    }
    for(int i=0;i<40;i++)now[i]=-1;
    printf("%lld\n",dfs(1)*C);
    return 0;
}