#include<bits/stdc++.h>
using namespace std;
const int lim = 40;
int graph[lim][lim];

bool vis[lim];



long long dfs(int node) {
    vis[node] = true;
    long long mask = 0LL;

    mask |= (1LL << node);

    for (int i = 0; i < lim; i++) {
        if (graph[node][i] && !vis[i]) {
            mask |= dfs(i);
        }
    }

    return mask;
}

long long reach_mask[lim];

bool newgraph[lim][lim];

std::vector<bool> get_indep_sets(std::vector<int> nodes) {
    int n = nodes.size();
    std::vector<bool> isindep(1 << n);

    isindep[0] = true;

    for (int mask = 1; mask < (1 << n); mask++) {
        int last_bit = 0;
        while ((mask & (1 << last_bit)) == 0) last_bit++;

        isindep[mask] = isindep[mask ^ (1 << last_bit)];
        for (int i = last_bit + 1; i < n; i++) {
            if ((1 << i) & mask) {
                if (newgraph[nodes[last_bit]][nodes[i]])
                    isindep[mask] = false;
            }
        }
    }

    return isindep;
}

long long count_indep_sets(int n) {
    std::vector<int> index(n);
    std::vector<int> half1, half2;

    for (int i = 0; i < n; i++) {
        if (i < n / 2) {
            index[i] = half1.size();
            half1.push_back(i);
        } else {
            index[i] = half2.size();
            half2.push_back(i);
        }
    }

    auto indep_a = get_indep_sets(half1);
    auto indep_b = get_indep_sets(half2);

    std::vector<int> count_indep(1 << half2.size());
    for (int i = 0; i < (1 << half2.size()); i++)
        count_indep[i] += indep_b[i];

    for (int b = 0; b < half2.size(); b++)
        for (int i = (1 << half2.size()) - 1; i >= 0; i--)
            if ((i & (1 << b))) {
                count_indep[i] += count_indep[i ^ (1 << b)];
            }

    long long res = 0LL;
    std::vector<int> cross_vec(half1.size());

    for (int i = 0; i < half1.size(); i++) {
        for (auto j: half2)
            if (newgraph[i][j])
                cross_vec[i] |= (1 << index[j]);
    }

    for (int i = 0; i < (1 << half1.size()); i++) {
        if (indep_a[i]) {
            int cross = 0;
            for (int j = 0; j < half1.size(); j++)
                if ((1 << j) & i)
                    cross |= cross_vec[j];
            res += count_indep[(1 << half2.size()) - 1 - cross];
        }
    }

    return res;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	vector<long long>a(n);
	long long all = 0;
	for(auto &x: a)cin >> x;
	for(auto x : a)all |= x;
	for(int bit = 0; bit < lim; bit++){
		long long x = all;
		for(auto y : a){
			if((1LL<<bit)&y)x&=y;
		}
		if(((1LL<<bit)&x) > 0){
			for(int bit2 = 0; bit2 < lim; bit2++){
				if(bit==bit2)continue;
				if((1LL<<bit2)&x){
					graph[bit][bit2] = 1;
				}
			}
		} else {
			graph[bit][bit] = 1;
		}
	}

    all = (1LL << 40) - 1;
    for (auto x: a) all &= x;

    for (int i = 0; i < lim; i++) {
        if (!graph[i][i]) {
            for (int j = 0; j < lim; j++)
                vis[j] = false;
            reach_mask[i] = dfs(i);
        }
    }

    std::map<long long, int> recolor;

    int last = 0;

    for (int i = 0; i < lim; i++) {
        if (!graph[i][i]) {
            recolor[reach_mask[i]] = last++;
        }
    }

    for (int i = 0; i < lim; i++)
        for (int j = 0; j < lim; j++) {
            if (!graph[i][i] && !graph[j][j] && graph[i][j]) {
                newgraph[recolor[reach_mask[i]]][recolor[reach_mask[j]]] =
                    newgraph[recolor[reach_mask[j]]][recolor[reach_mask[i]]] = 1;
            }
        }

    std::cout << count_indep_sets(last) - (all != 0);

	return 0;
}