#include <bits/stdc++.h>
using namespace std;

#define rep(i, n, N) for (int i = (n); i <= (N); i++)
#define For(i, n, N) for (int i = (n); i <  (N); i++)
#define rap(i, n, N) for (int i = (n); i >= (N); i--)
#define rip(i, n, N, V) for (int i = (n); i <= (N); i += V)

using vi = vector<int>;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
// using lll = __int128;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
// using plll = pair<lll, lll>;

#define fi first
#define se second
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define mp make_pair
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front

#define endl '\n'
#define clz(x) (1 << (31 - __builtin_clz(x)))
#define all(x) x.begin(), x.end()
#define ari(x) array<int, x>
#define arll(x) array<ll, x>
#define mems(x, y) memset(x, y, sizeof x)
#define debug(x) cout << #x << " = " << (x) << endl
#define debugV(v, x) cout << #v << "[" << (x) << "] = " << v[x] << endl
#define out(x, y) cout << "]] " << (x) << " " << (y) << endl

#ifdef LOCAL
#define DEBUG(...) __VA_ARGS__;
#else
#define DEBUG(...)
#endif

template<class A, class B>
ostream& operator<<(ostream& os, const pair<A, B> &p) {
  return os << "(" << p.fi << ", " << p.se << ")";
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &v) {
  os << "{"; bool osu = 1;
  for (auto i : v) {if (!osu) {os << ", ";} os << i; osu = 0;}
  return os << "}";
}
template<class T, ull sz>
ostream& operator<<(ostream& os, const array<T, sz> &v) {
  os << "{"; bool osu = 1;
  for (auto i : v) {if (!osu) {os << ", ";} os << i; osu = 0;}
  return os << "}";
}

void solve(int tt = 0) {
  int n; cin >> n;
  vector<ll> a(n);
  for(ll &i : a) cin >> i;

  vector<ll> b;
  For(bit, 0, 40) {
    int cnt = 0;
    ll mask = ~0ll;
    For(i, 0, n) if(a[i] >> bit & 1) {
      cnt++;
      mask &= a[i];
    }
    if(cnt > 0 && cnt < n)
      b.pb(mask);
  }
  ll all_mask = ~0ll;
  for(ll i : a) all_mask &= i;
  // b.pb(all_mask);
  sort(all(b));
  DEBUG(cerr << b << '\n');
  DEBUG({
    set<ll> s;
    int sz = b.size();
    For(mask, 1, 1<<sz) {
      ll cur = 0;
      For(i, 0, sz) if(mask >> i & 1) cur |= b[i];
      s.insert(cur);
      cerr << mask << " -> " << cur << '\n';
    }
    cerr << s.size() + 1 << '\n';
  });

  int sz = b.size();
  // int sz1 = 2, sz2 = sz-sz1;
  int sz1 = sz/2, sz2 = sz-sz1;
  ll ans = 0;

  vector<ll> dp(1<<sz1, -1);
  dp[0] = all_mask;
  map<ll, ll> val;
  val[all_mask] = 0;
  For(mask, 1, 1<<sz1) {
    ll cur = 0;
    For(i, 0, sz1) if(mask >> i & 1) cur |= b[i];
    bool ok = 1;
    For(i, 0, sz1) if(mask >> i & 1) {
      if(cur == dp[mask^(1<<i)]) {
        ok = 0;
      }
    }
    if(ok) val[cur] = max(val[cur], (ll)mask);
    dp[mask] = cur;
  }
  // ans = val.size();
  DEBUG(cerr << vector(all(val)) << '\n');
  vector<ll> F(1<<sz1);
  for(auto &[v, i] : val)
    F[i] = 1;
  For(i, 0, sz1) For(mask, 0, 1<<sz1) {
    if(mask >> i & 1)
      F[mask] += F[mask^(1<<i)];
  }
  DEBUG(cerr << "F = " << F << '\n');
  val.clear();
  dp.clear();
  dp.resize(1<<sz2);
  dp[0] = all_mask;
  val[all_mask] = 0;
  For(mask, 1, 1<<sz2) {
    ll cur = 0;
    For(i, 0, sz2) if(mask >> i & 1) cur |= b[i+sz1];
    bool ok = 1;
    For(i, 0, sz2) if(mask >> i & 1) {
      if(cur == dp[mask^(1<<i)]) {
        ok = 0;
      }
    }
    ll msk = (ll)mask<<sz1;
    if(ok) val[cur] = max(val[cur], msk);
    dp[mask] = cur;
  }
  DEBUG(cerr << vector(all(val)) << '\n');
  for(auto [v, i] : val) {
    ll fmask = (1<<sz1)-1;
    DEBUG(cerr << v << ' ' << (fmask^(v&fmask)) << ' ' << F[fmask^(fmask&v)] << '\n');
    ans += F[fmask ^ (v&fmask)];
  }
  cout << ans << '\n';
}

int main() {
  int t = 1; //cin >> t;
  rep(ct, 1, t) solve(ct);
  return 0;
}