#include <bits/stdc++.h>

#define ll long long
#define fi first
#define se second

using namespace std;

const int maxn = 2e5 + 10, LOG = 40;

int n, m;
ll a[maxn];
vector <ll> v;

//void ispis(ll x){
//	for(int i = 0; i < LOG; i++){
//		if(x & (1LL << i)) cout << 1;
//		else cout << 0;
//	}
//	cout << endl;
//}

bool cmp(ll x, ll y){
	return __builtin_popcountll(x) < __builtin_popcountll(y);
}

ll rek(){
	if(v.empty()) return 1;
	
	ll sol = 0;
	
	vector <ll> v2 = v;
	v.clear();
	
	for(int i = 0; i < v2.size(); i++){
		if((v2.back() | v2[i]) == v2.back()) continue;
		
		v.push_back(v2[i]);
	}
	
	sol += rek();
	v = v2;
	
	v.pop_back();
	sol += rek();
	v = v2;
	
	return sol;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	
	bool nula = 0;
	
	for(int i = 0; i < n; i++){
		cin >> a[i];
	
		if(!a[i]) nula = 1;
	}
	
	vector <ll> v2;
	
	
	for(int i = 0; i < LOG; i++){
		ll x = (1LL << 42) - 1;
		
		for(int j = 0; j < n; j++){
			if(a[j] & (1LL << i)) x &= a[j];
		}
		
		if(x != (1LL << 42) - 1) v2.push_back(x);
	}
	
	sort(v2.begin(), v2.end());
	
	for(int i = 0; i < v2.size(); i++){
		if(i && v2[i] == v2[i - 1]) continue;
		
		v.push_back(v2[i]);
	}
	
	sort(v.begin(), v.end(), cmp);
	
	cout << rek() - !nula;
	
	return 0;
}