#include <bits/stdc++.h>
#define all(a) begin(a), end(a)
#define int long long
using namespace std;

const int N = 2e5 + 11;
int a[N];
bool valid[40][40];
bool dp1[1 << 20], dp2[1 << 20];
int sos[1 << 20];
bool val[20][1 << 20];
void build(bool* dp, vector<int> r, int sh){
	for (int i = 0; i < 20; i++) {
		val[i][0] = true;
		for (int j = 1; j < (1 << 20); j++) {
			int lb = j & -j;
			val[i][j] = val[i][j ^ lb] && valid[sh + i][sh + __lg(lb)];
		}
	}
	for (int msk = 0; msk < (1 << 20); msk++) {
		bool ok = true;
		if (msk) {
			int lb = msk & -msk;
			if (!val[__lg(lb)][msk ^ lb]) {
				ok = false;
			}
		}
		for (int j = 0; j < 20; j++) {
			if (msk & (1 << j)) {
				if (r[j] == 0) ok = false;
			}
		}
		dp[msk] = ok;
	}
}

void solve(){
	int n; cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

	int and_all = (1LL << 40) - 1;
	int or_all = 0;
	for (int i = 0; i < n; i++) {
		and_all &= a[i];
		or_all |= a[i];
	}

	or_all ^= and_all;
	for (int i = 0; i < n; i++) {
		a[i] ^= and_all;
	}

	int msk = (1LL << 41) - 1;
	set<int> s;
	for (int i = 0; i < 40; i++) {
		int x = msk;
		for (int j = 0; j < n; j++) {
			if ((a[j] >> i) & 1) {
				x &= a[j];
			}
		}
		if (x == msk) continue;
		s.insert(x);
	}

	vector<int> r(all(s));
	r.resize(40);
	for (int i = 0; i < 40; i++) {
		for (int j = 0; j < 40; j++) {
			valid[i][j] = r[i] == 0 || r[j] == 0 ? false : !((r[i] & r[j]) == r[i] || (r[i] & r[j]) == r[j]);
		}
	}
	build(dp1, {r.begin(), r.begin() + 20}, 0);
	build(dp2, {r.begin() + 20, r.end()}, 20);
	for (int i = 0; i < (1 << 20); i++) {
		sos[i] = dp2[i];
	}
	for (int j = 0; j < 20; j++) {
		for (int i = 0; i < (1 << 20); i += 1 << (j + 1)) {
			for (int k = 0; k < (1 << j); k++) {
				sos[i + k + (1 << j)] += sos[i + k];
			}
		}
	}
	int ans = 0;
	for (int i = 0; i < (1 << 20); i++) {
		if (!dp1[i]) continue;
		int msk = 0;
		for (int j = 0; j < 20; j++) {
			bool ok = true;
			for (int k = 0; k < 20; k++) {
				if ((i >> k) & 1) {
					if (!valid[k][20 + j]) {
						ok = false;
					}
				}
			}
			if (ok) msk += (1 << j);
		}
		ans += sos[msk];
	}
	cout << ans << '\n';
	// for (auto x : s) {
	// 	cout << x << ' ';
	// }
	// cout << endl;
}

int32_t main(){
#ifndef LOCAL
	cin.tie(0)->sync_with_stdio(false);
#endif
	int t = 1;
	// cin >> t;
	while (t--) {
		solve();
	}
}