#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];
ll b2[LOG];


ll rek(){
	ll sol = 0;
	
	int naj = 0, cnt = 0;
	
	for(int i = 0; i < LOG; i++){
		if(__builtin_popcount(b[i]) > __builtin_popcount(b[naj])) naj = i;
		if(b[i]) cnt++;
	}
	
	if(__builtin_popcount(b[naj]) <= 1) return (1LL << cnt);
	
	ost ^= b[naj];
	
	for(int i = 0; i < LOG; i++){
		b2[i] = b[i];
		b[i] &= ost;
	}
	
	sol += rek();
		
	for(int i = 0; i < LOG; i++){
		b[i] = b2[i];
	}

	ost ^= b[naj];
	
	ost ^= (1LL << naj);
	
	for(int i = 0; i < LOG; i++){
		b2[i] = b[i];
		b[i] &= ost;
	}
	
	b[naj] = 0;
	
	sol += rek();
	
	ost ^= (1LL << naj);
	
	for(int i = 0; i < LOG; i++){
		b[i] = b2[i];
	}
	
	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++){
		b[i] = (1LL << 41) - 1;
		
		for(int j = 0; j < n; j++){
			if(a[j] & (1LL << i)) b[i] &= a[j];
		}
		
		if(b[i] == (1LL << 41) - 1) b[i] = 0;
		else{
			ost ^= (1LL << i);
		}
	}
	
	cout << rek();
	
	return 0;
}