243A

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            int x; cin>>x; while(x--)
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());
#define fastio          ios_base::sync_with_stdio(0); cin.tie(0);
int32_t main()
{
    fastio;
    int n;cin>>n;vi a(n);
    set<int> st;
    map<int,pqs> hash;
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<n;i++)
    {
        int x=a[i];
        for(int j=0;j<=20;j++)
        {
            if((x&(1<<j))!=0) hash[j].push(i);
        }
    }
    for(int i=0;i<n;i++)
    {
        int x=a[i];
        st.insert(a[i]);
        for(int j=0;j<=20;j++)
        {
            if((x&(1<<j))!=0) hash[j].pop();
        }
        vector<pii> b;
        for(int j=0;j<=20;j++)
        {
            if(!hash[j].empty()) b.pb({hash[j].top(),j});
        }
        sort(b.begin(),b.end());
        for(int j=0;j<b.size();j++)
        {
            x=x|(1<<(b[j].ss));
            st.insert(x);
        }
        b.clear();
        cout<<st.size()<<endl;
    }
    cout<<st.size()<<endl;

return 0;
}