#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    vector<int> v, u; // vがand用, uがplus用
    v.push_back(1);
    u.push_back(1);
    int cnt = 0;
    int th = 1<<10;
    // th = 1<<5;
    int mask = th-1;
    bool zero = false;
    for(int i = 0; i < n; i++){
        if(a[i] == 0) zero = true;
        if(zero){
            cout << 1 << endl;
            continue;
        }
        vector<int> st, st_v, st_u;
        for(int x : v) {
            st.push_back(x&a[i]);
            st_v.push_back((x*a[i])&mask);
            assert(x < th);
        }
        for(int x : u) {
            st.push_back(x*a[i]);
            if(x*a[i] >= th) cnt++;
            assert(x < th);
        }
        
        v.clear();
        u.clear();
        for(int x : st){
            if(x >= th){
                st_v.push_back(x&mask);
            }else{
                st_v.push_back(x);
                st_u.push_back(x);
            }
        }
        vector<bool> used_v(1<<10, false);
        vector<bool> used_u(1<<10, false);
        for(int x: st_v) {
            if(!used_v[x]) {
                v.push_back(x);
                used_v[x] = true;
            }
        }
        for(int x: st_u) {
            if(!used_u[x]){
                u.push_back(x);
                used_u[x] = true;
            }
        }
        cout << cnt+(int)u.size() << endl;
    }
}