#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define B 40
#define M ((1<<20)+10)

int n;
bool rec[B][B][2][2];
bool fl[B][2];
int id[B], tot;
ll out[B];

ll dp[M];
void dypro() {
  int b = tot/2;
  ll full = (1<<b)-1;
  for(ll i=0;i<=full;++i) {
    bool fl = true;
    for(int j=0;j<b;++j) if((i>>j)&1) {
      if(((out[j]&full)|i)>i) {
        fl = false;
        break;
      }
    }
    if(fl) dp[i] = 1;
  }
  for(int i=0;i<b;++i) {
    for(ll j=0;j<=full;++j) if((j>>i)&1) {
      dp[j^(1<<i)] += dp[j];
    }
  }
  ll ans = 0;
  ll full2 = ((1ll<<tot)-1)^full;
  for(ll i=0;i<=(full2>>b);++i) {
    ll st = i<<b, to = 0;
    bool fl = true;
    for(int j=b;j<tot;++j) if((st>>j)&1) {
      if(((out[j]&full2)|st)>st) {
        fl = false;
        break;
      } else {
        to |= out[j]&full;
      }
    }
    if(fl) ans += dp[to];
  }
  printf("%lld\n", ans);
}

int main(void) {
  scanf("%d", &n);
  for(int i=0;i<n;++i) {
    ll t; scanf("%lld", &t);
    for(int j=0;j<B;++j) {
      fl[j][(t>>j)&1] = 1;
      for(int k=j+1;k<B;++k) {
        rec[j][k][(t>>j)&1][(t>>k)&1] = 1;
      }
    }
  }
  for(int i=0;i<B;++i) if(!(fl[i][0] && fl[i][1])) id[i] = -1;
  for(int i=0;i<B;++i) if(~id[i]) {
    id[i] = -2;
    for(int j=i+1;j<B;++j) if(~id[j]) {
      int sm = (int)rec[i][j][0][0] + (int)rec[i][j][0][1] + (int)rec[i][j][1][0] + (int)rec[i][j][1][1];
      if(sm == 2 && rec[i][j][0][0]) {
        id[j] = -1;
      }
    }
  }
  for(int k=0;k<B;++k) {
    for(int i=0;i<B;++i) if(id[i] == -2) {
      bool fl = true;
      for(int j=0;j<i;++j) if(id[j] == -2) {
        int sm = (int)rec[i][j][0][0] + (int)rec[i][j][0][1] + (int)rec[i][j][1][0] + (int)rec[i][j][1][1];
        if(sm == 3 && rec[j][i][1][0] == false) fl = false;
      }
      for(int j=i+1;j<B;++j) if(id[j] == -2) {
        int sm = (int)rec[i][j][0][0] + (int)rec[i][j][0][1] + (int)rec[i][j][1][0] + (int)rec[i][j][1][1];
        if(sm == 3 && rec[i][j][0][1] == false) fl = false;
      }
      if(fl) id[i] = tot++;
    }
  }
  for(int i=0;i<B;++i) if(~id[i]) id[i] = tot-id[i]-1;
  for(int i=0;i<B;++i) if(~id[i]) {
    // cerr<<i<<" valid"<<endl;
    for(int j=i+1;j<B;++j) if(~id[j]) {
      int sm = (int)rec[i][j][0][0] + (int)rec[i][j][0][1] + (int)rec[i][j][1][0] + (int)rec[i][j][1][1];
      if(sm == 3) {
        if(rec[i][j][0][1] == false) out[id[j]] |= 1<<id[i];
        else if(rec[i][j][1][0] == false) out[id[i]] |= 1<<id[j];
      }
    }
  }
  // cerr<<tot<<"!"<<endl;
  if(tot <= 1) {
    printf("%d\n", tot*2);
    return 0;
  }
  dypro();
  return 0;
}