#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 ost;
ll a[maxn];
ll b[LOG];
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;
//}

ll rek(){
	if(v.empty()) return 1;
	
	ll sol = 0;
	
	sort(v.begin(), v.end());
	vector <ll> v2;
	
	for(int i = 0; i < v.size(); i++){
		if(i && v[i] == v[i - 1]) continue;
		if(v[i] == 0) continue;
		
		v2.push_back(v[i]);
//		ispis(v[i]);
	}
//	cout << endl;
	
	v = v2;
	
	int naj = 0;
	
	for(int i = 0; i < v.size(); i++){
		if(__builtin_popcountll(v[i]) > __builtin_popcount(v[naj])) naj = i;
	}
	
	if(__builtin_popcount(v[naj]) == 1) return (1LL << v.size());
	
//	cout << naj << endl;
	
	v.clear();
	
	for(int i = 0; i < v2.size(); i++){
		if((v2[naj] | v2[i]) == v2[naj]) continue;
		
		v.push_back(v2[i]);
	}
	
	sol += rek();
	
	v = v2;
	
	v.erase(v.begin() + naj);
	
	sol += rek();
	
	v = v2;
	
	return sol;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	
	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) v.push_back(x);
	}
	
	cout << rek();
	
	return 0;
}