#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define ALL(x) x.begin(), x.end()
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;

template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
};

template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
};

int n;
int sz;
long A[200003];
long B[200003];
vector<long> mem[40];
vector<int> vec[45];

long dp[45];
void dfs(int u)
{
    long res = 1;
    for(int v : vec[u])
    {
        dfs(v);
        res = res*dp[v];
    }
    
    dp[u] = res+1;
    // cout << u << " " << dp[u] << "\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> A[i];
        for(int j = 0; j < 40; j++)
        {
            long bit = (1LL<<j);
            if(bit&A[i])
                mem[j].push_back(A[i]);
        }
    }
    set<long> st;
    for(int j = 0; j < 40; j++)
    {
        long sand = (1LL<<40)-1;
        if(mem[j].size() == 0) continue;
        for(long x : mem[j])
        {
            sand &= x;
            // cout << j << " " << x << "\n";
        }
            
        st.insert(sand);
    }
    
    for(long x : st)
    {
        B[++sz] = x;
    }
    for(int i = 1; i <= sz; i++)
    {
        long mx = 0;
        int idx = 0;
        for(int j = 1; j < i; j++)
        {
            // cout << i << " " << j << " " << (B[i]&B[j]) << '\n';
            if((B[i]&B[j]) == B[j])
            {
                mx = max(mx, B[j]);
                idx = j;
            }
        }
        // cout << "EDJ : " << i << " " << idx << "\n";
        vec[idx].push_back(i);
    }
    dfs(0);
    cout << dp[0]-1 << "\n";
    return 0;
}