#include "iostream"
#include "algorithm"
#include "cstring"
#include "cstdio"
#include "cmath"
#include "vector"
#include "map"
#include "set"
#include "ctime"
using namespace std;
#define int long long
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define all(x) (x).begin() , (x).end()
#define mem( a ) memset( a , 0 , sizeof a )
typedef long long ll;
#define P 1000000007
const int MAXN = 2e6 + 20;
int n , m;
ll A[MAXN];
ll suf[44];
ll num[MAXN];

void sums( int a[] , int len ) {
	for( int mid = 2 ; mid <= len ; mid <<= 1 ) 
		for( int i = 0 ; i < len ; i += mid )
			for( int j = i ; j < i + ( mid >> 1 ) ; ++ j )
				a[j + ( mid >> 1 )] += a[j];
}

vi ve;
int wkr( ) {
	rep( t , 1 , 1000000 ) {
		int a = rand() % ve.size() , b = rand() % ve.size();
		int x;
		if( rand() % 2 ) {
			x = ve[a] & ve[b];
		} else {
			x = ve[a] | ve[b];
		}
		int f = 0;
		for( int t : ve ) {
			if( t == x ) {
				f = 1;
				break;
			}
		}
		if( !f ) ve.pb( x );
	}
	return ve.size();
}

void solve() {
	cin >> n;
	int u0 = 0 , ss = -1;
	rep( i , 1 , n ) {
		scanf("%lld",A + i);
		ve.pb( A[i] );
		ss &= A[i];
	}
	
	if( !ss ) ++ u0;
	vi vec;
	rep( k , 0 , 39 ) {
		ll f = -1;
		rep( i , 1 , n ) {
			if( A[i] & ( 1ll << k ) ) f &= A[i];
		} 
		if( ~f ) vec.pb( f );
	}
	sort( all( vec ) ); vec.erase( unique( all( vec ) ) , vec.end() );
	sort( vec.begin() , vec.end() , []( int a , int b ) { return __builtin_popcountll( a ) > __builtin_popcountll( b ); } );
	
	int sz = vec.size();
	int ls = sz / 2 , rs = sz - ls;
	rep( i , 0 , sz - 1 ) {
		rep( j , i + 1 , sz - 1 ) {
			if( ( vec[i] & vec[j] ) == vec[j] ) suf[i] |= ( 1ll << j );
		}
	}
	// for( int x : vec ) {
	// 	cout << x << endl;
	// }
	// rep( i , 0 , sz - 1 ) cout << suf[i] << ' '; puts("");

	for( int s = 0 ; s < ( 1 << rs ) ; ++ s ) {
		int flg = 0;
		rep( i , 0 , rs - 1 ) if( s & ( 1 << i ) ) {
			if( suf[i + ls] & ( s << ls ) ) {
				flg = 1; break;
			}
		}
		if( flg ) continue;
		++ num[s];
	}

	sums( num , 1 << 20 );

	ll ans = 0;
	for( int s = 0 ; s < ( 1 << ls ) ; ++ s ) {
		int flg = 0 , ns = 0;
		rep( i , 0 , ls - 1 ) if( s & ( 1 << i ) ) {
			if( suf[i] & s ) {
				flg = 1; break;
			}
			ns |= ( suf[i] >> ls );
		}
		if( flg ) continue;
		ans += num[( ~ns ) & ( ( 1 << 20 ) - 1 )];
		// cout << ans << endl;
	}
	// cout << wkr() << endl;
	cout << ans - 1 + u0 << endl;
} 

signed main() {
	srand( time(0) );
    // freopen("bird.in","r",stdin),freopen("bird.out","w",stdout);
//    int T;cin >> T;while( T-- ) solve();
    solve();
}