#include <iostream>
#include <cstring>
#include <algorithm>

#define MOD 1000000007
using namespace std;
int n,sol,i,V[1<<19+1],Q[1<<20],j;
bool VIZ[1<<20];
int main()
{
    cin.sync_with_stdio(false);
    cin>>n;
    sol = n;
    for(i=1;i<=n;i++)
    {
        cin>>V[i];
    }
    sort(V+1,V+n+1);
    int nr = 0;
    for(i=1;i<=n;i++)
    {
        if(VIZ[V[i]])
            sol--;
        else
        {
            for(j=1;j<=Q[0];j++)
            {
                if(VIZ[(Q[j]|V[i])] == 0)
                {
                    Q[++Q[0]] = (Q[j]|V[i]);
                    VIZ[(Q[j]|V[i])] = 1;
                }
            }
            Q[++Q[0]] = V[i];
            VIZ[V[i]] = 1;
        }
    }
    cout<<sol;
    return 0;
}