#include<bits/stdc++.h>
using namespace std;


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

inline li calc(li num) {
    li res = 0;
    while (num > 0) {
        bitset<60> bs(num);
        num = num % bs.count();
        res++;
    }
    return res;
}

li pow2[2][200200];
li pc[2];
li total[2];
li cnt;
li n;
string x;

int main() {
    cnt = 0;
    cin >> n >> x;
    rin{
        if (x[i] == '1') {
            cnt++;
        }
    }
    if (cnt == 0) {
        // x == 0
        // 何やっても x % 1 => 0
        rin{
            cout << 1 << endl;
        }
        return 0;
    }
    if (cnt == 1) {
        // 00000000010000000
        // 1が0になる => x=0
        // 0が1になる => popcnt(x) = 2
        if (x.back() == '1') {
            rep(i, n - 1) {
                cout << 2 << endl;
            }
            cout << 0 << endl;
        } else {
            rin{
                if (x[i] == '1') {
                    cout << 0 << endl;
                } else if (i < n - 1) {
                    cout << 1 << endl;
                } else {
                    cout << 2 << endl;
                }
            }
        }
        return 0;
    }
    pc[0] = cnt - 1;
    pc[1] = cnt + 1;

    pow2[0][0] = 1 % pc[0];
    pow2[1][0] = 1 % pc[1];
    rin{
        pow2[0][i + 1] = (pow2[0][i] * 2) % pc[0];
        pow2[1][i + 1] = (pow2[1][i] * 2) % pc[1];
    }
    rin{
        if (x[i] == '1') {
            total[0] = (total[0] + pow2[0][n - 1 - i]) % pc[0];
            total[1] = (total[1] + pow2[1][n - 1 - i]) % pc[1];
        }
    }

    rin{
        if (x[i] == '1') {
            li now = (total[0] - pow2[0][n - 1 - i] + pc[0]) % pc[0];
            cout << 1 + calc(now) << endl;
        } else {
            li now = (total[1] + pow2[1][n - 1 - i]) % pc[1];
            cout << 1 + calc(now) << endl;
        }
    }


    return 0;
}

Measured memory_bytes: 6820