#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000009;
const int mod17 = 1000000007;
const ll INF = (ll)mod17 * mod17;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//------------------------------------

struct graph {
private:
	int n;
	vector<vector<int>> G, rG;
	vector<bool> used;
	vector<int> vs;

	int mk;
	vector<vector<int>> fG;
	vector<vector<int>> ori;
	vector<int> trans;
public:
	graph(int sz) {
		n = sz;
		G.resize(n);
		rG.resize(n);
		used.resize(n);

		fG.resize(n);
		trans.resize(n, -1);
		ori.resize(n);
	}
	void add_edge(int a, int b) {
		G[a].push_back(b);
		rG[b].push_back(a);
	}
	void dfs(int v) {
		used[v] = true;
		rep(i, G[v].size()) {
			if (!used[G[v][i]])dfs(G[v][i]);
		}
		vs.push_back(v);
	}
	void rdfs(int v, int k) {
		used[v] = true;
		queue<int> q; q.push(v);
		vector<int> c;
		while (!q.empty()) {
			int id = q.front(); q.pop();
			ori[k].push_back(id);
			rep(j, rG[id].size()) {
				int to = rG[id][j];
				if (used[to]) {
					if (trans[to] >= 0)c.push_back(trans[to]);
					continue;
				}
				used[to] = true; q.push(to);
			}
		}
		sort(c.begin(), c.end());
		int len = unique(c.begin(), c.end()) - c.begin();
		rep(i, len) {
			fG[c[i]].push_back(k);
		}
		rep(i, ori[k].size()) {
			trans[ori[k][i]] = k;
		}
	}
	void scc() {
		fill(used.begin(), used.end(), false);
		rep(i, n) {
			if (!used[i])dfs(i);
		}
		fill(used.begin(), used.end(), false);
		int k = 0;
		per(i, (int)vs.size()) {
			if (!used[vs[i]]) {
				rdfs(vs[i], k); k++;
			}
		}
		mk = k;
	}
	vector<vector<int>> get_fG() {
		return fG;
	};
	vector<vector<int>> get_ori() {
		return ori;
	};
	//0->false,1->true
	vector<int> two_sat(int n) {
		rep(i, n) {
			if (trans[i] == trans[i + n])return {};
		}
		vector<int> res(n);
		vector<bool> used(n);
		vector<bool> isok(mk);
		per(i, mk) {
			isok[i] = true;
			for (int to : fG[i])if (!isok[to])isok[i] = false;
			for (int id : ori[i]) {
				if (used[id % n])isok[i] = false;
			}
			if (isok[i]) {
				for (int id : ori[i]) {
					used[id % n] = true;
					res[id % n] = id / n;
				}
			}
		}
		return res;
	}
};
//void expr() {
//	vector<ll> dp(41);
//	dp[0] = dp[1] = dp[2] = 1;
//	for (int i = 3; i <= 40; i++) {
//		dp[i] = dp[i - 1] + dp[i - 3];
//	}
//	coutarray(dp);
//}

ll sol(int n,vector<ll> a) {
	vector<bool> exi(40);
	/*vector<vector<int>> G(40);
	vector<vector<int>> rG(40);*/
	graph g(40);
	rep(j, 40) {
		int c = 0;
		ll x = (1ll << 40) - 1;
		rep(i, n) {
			if (a[i] & (1ll << j)) {
				c++;
				x &= a[i];
			}
		}
		if (c == 0) {
			exi[j] = false; continue;
		}
		exi[j] = true;
		rep(i, 40) {
			if (i == j)continue;
			if (x & (1ll << i)) {
				//cout << "! " << j << " " << i << "\n";
				g.add_edge(j, i);
				/*G[j].push_back(i);
				rG[i].push_back(j);*/
			}
		}
	}
	g.scc();
	auto G = g.get_fG();
	auto ori = g.get_ori();
	int sz = G.size();
	vector<bool> isok(sz);
	rep(i, sz)for (int id : ori[i]) {
		if (exi[id])isok[i] = true;
	}
	//coutarray(isok);
	vector<ll> adj(sz);
	rep(i, sz)for (int to : G[i]) {
		adj[to] |= (1ll << i);
		//cout << "! " << i << " " << to << "\n";
	}
	unordered_set<ll> stc1;
	rep(i, 40)stc1.insert(1ll << i);
	ll ans = 0;
	function<void(ll, int, ll)> dfs = [&](ll s, int i, ll val) {
		if (i < 0) {
			ans += val; return;
		}
		if (!isok[i]) {
			dfs(s, i - 1, val);
			return;
		}
		if (s & (1ll << i)) {
			ll x = adj[i] & s;
			if (x == 0) {
				dfs(s, i - 1, val * 2);
			}
			else {
				dfs(s, i - 1, val);
				dfs(s ^ x, i - 1, val);
			}
		}
		else {
			dfs(s, i - 1, val);
		}
	};
	ll ss = (1ll << sz) - 1;
	dfs(ss, sz - 1, 1);
	//0?
	ll x = a[0];
	rep(i, n)x &= a[i];
	if (x != 0)ans--;
	//cout << "? " << x << "\n";
	return ans;
}
ll calc_naive(int n, vector<ll> a) {
	set<ll> st;
	rep(i, a.size())st.insert(a[i]);
	int i = 0;
	while (i < a.size()) {
		rep(j, i) {
			ll x = a[i] & a[j];
			if (!st.count(x)) {
				st.insert(x);
				a.push_back(x);
			}
			x = a[i] | a[j];
			if (!st.count(x)) {
				st.insert(x);
				a.push_back(x);
			}
		}
		i++;
	}
	return st.size();
}

void expr() {
	uniform_int_distribution<> udn(1, 10);
	uniform_int_distribution<> uda(0, 32);
	rep(t, 1000) {
		int n = udn(mt);
		vector<ll> a(n);
		rep(i, n)a[i] = uda(mt);
		ll v1 = sol(n, a);
		ll v2 = calc_naive(n, a);
		if (v1 != v2) {
			cout << n << "\n";
			coutarray(a);
			cout << v1 << " " << v2 << "\n";
			exit(0);
		}
	}
	cout << "fin\n";
}
void solve() {
	int n; cin >> n;
	vector<ll> a(n);
	rep(i, n)cin >> a[i];
	vector<bool> exi(40);
	/*vector<vector<int>> G(40);
	vector<vector<int>> rG(40);*/
	graph g(40);
	rep(j, 40) {
		int c = 0;
		ll x = (1ll << 40) - 1;
		rep(i, n) {
			if (a[i] & (1ll << j)) {
				c++;
				x &= a[i];
			}
		}
		if (c == 0) {
			exi[j] = false; continue;
		}
		exi[j] = true;
		rep(i, 40) {
			if (i == j)continue;
			if (x & (1ll << i)) {
				//cout << "! " << j << " " << i << "\n";
				g.add_edge(j,i);
				/*G[j].push_back(i);
				rG[i].push_back(j);*/
			}
		}
	}
	g.scc();
	auto G = g.get_fG();
	auto ori = g.get_ori();
	int sz = G.size();
	vector<bool> isok(sz);
	rep(i, sz)for (int id : ori[i]) {
		if (exi[id])isok[i] = true;
	}
	//coutarray(isok);
	vector<ll> adj(sz);
	rep(i, sz)for (int to : G[i]) {
		adj[to] |= (1ll << i);
		//cout << "! " << i << " " << to << "\n";
	}
	unordered_set<ll> stc1;
	rep(i, 40)stc1.insert(1ll << i);
	ll ans = 0;
	function<void(ll, int, ll)> dfs = [&](ll s, int i, ll val) {
		if (i<0) {
			ans += val; return;
		}
		if (!isok[i]) {
			dfs(s, i - 1, val);
			return;
		}
		if (s & (1ll << i)) {
			ll x = adj[i] & s;
			if (x == 0) {
				dfs(s, i - 1, val * 2);
			}
			else {
				dfs(s, i - 1, val);
				dfs(s ^ x, i - 1, val);
			}
		}
		else {
			dfs(s, i - 1, val);
		}
	};
	ll ss = (1ll << sz) - 1;
	dfs(ss, sz-1, 1);
	//0?
	ll x = a[0];
	rep(i, n)x &= a[i];
	if (x != 0)ans--;
	//cout << "? " << x << "\n";
	cout << ans << "\n";

	/*vector<int> ids;
	queue<int> que;
	vector<int> cnt(40);
	rep(i, 40)cnt[i] = G[i].size();
	vector<ll> adj(40);
	rep(i, 40) {
		for (int to : rG[i]) {
			adj[i] |= (1ll << to);
		}
	}
	unordered_set<ll> stc1;
	rep(i, 40)stc1.insert(1ll << i);
	rep(i, 40)if (exi[i])if (cnt[i] == 0) {
		que.push(i);
	}
	while (!que.empty()) {
		int id = que.front(); que.pop();
		ids.push_back(id);
		for (int to : rG[id]) {
			cnt[to]--;
			if (cnt[to] == 0) {
				que.push(to);
			}
		}
	}
	ll ans = 0;
	function<void(ll, int, ll)> dfs = [&](ll s, int i, ll val) {
		if (i == ids.size()) {
			ans += val; return;
		}
		int id = ids[i];
		if (s & (1ll << id)) {
			ll x = adj[id] & s;
			if (x == 0) {
				dfs(s, i + 1, val * 2);
			}
			else if (stc1.count(x)) {
				dfs(s, i + 1, val * 3);
			}
			else {
				dfs(s, i + 1, val);
				dfs(s ^ x, i + 1, val);
			}
		}
		else {
			dfs(s, i + 1, val);
		}
	};
	ll ss = 0;
	rep(i, 40)if (exi[i])ss |= (1ll << i);
	dfs(ss, 0, 1);
	cout << ans << "\n";*/
}



signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed<<setprecision(10);
	//init_f();
	//init();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}