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

#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#define itrout(x) for(int i=0;i<x.size();i++) {cout << x[i] << (i==x.size()-1 ? "\n" : " ");}
#ifdef LOCAL
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl
#define itrdebug(x) cerr << #x << " "; for (auto & el : (x)) {cerr << (el) << " ";} cerr << endl
#define dassert(...) assert(__VA_ARGS__)
#else
#define debug(x)
#define itrdebug(x)
#define dassert(...)
#endif
//#define int long long

typedef long long ll;
const ll MOD = 1e9 + 7;
const long double EPS = 1e-8;

namespace mod {
    long long pow(long long a, long long x, long long p) {
        long long res = 1;
        while(x > 0) {
            if( x % 2 != 0) {
                res = (res * a) % p;
            }
            a = (a * a) % p;
            x /= 2;
        }
        return res;
    }

    long long inverse(long long a, long long p) {
        //calculates the modular multiplicative of a mod m.
        //(assuming p is prime).
        return pow(a, p-2, p);
    }

    long long factorial(long long a, long long p) {
        long long fact = 1;
        for (long long i=2; i<=a; i++) {
            fact *= i;
            fact %= p;
        }
        return fact;
    }

    template <long long MOD>
    struct Int {
        long long x;
        Int(long long x = 0) : x((x % MOD + MOD) % MOD){}
        Int operator-() const { return Int<MOD>(-x);}
        Int& operator+=(const Int<MOD> a) {
            if ((x += a.x) >= MOD) x -= MOD;
            return *this;
        }
        Int& operator-=(const Int<MOD> a) {
            if ((x += MOD-a.x) >= MOD) x -= MOD;
            return *this;
        }
        Int& operator*=(const Int<MOD> a) {
            (x *= a.x) %= MOD; return *this;
        }
        Int operator+(const Int<MOD> a) const { return Int<MOD>(*this) += a;}
        Int operator-(const Int<MOD> a) const { return Int<MOD>(*this) -= a;}
        Int operator*(const Int<MOD> a) const { return Int<MOD>(*this) *= a;}
        Int pow(long long t) const {
            if (!t) return 1;
            Int<MOD> a = pow(t >> 1);
            a *= a;
            if (t&1) a *= *this;
            return a;
        }

        Int inv() const { return pow(MOD - 2);}
        Int& operator/=(const Int<MOD> a) { return *this *= a.inv();}
        Int operator/(const Int<MOD> a) const { return Int<MOD>(*this) /= a;}
    };
}
std::istream& operator>>(std::istream& is, const mod::Int<MOD>& a) { return is >> a.x;}
std::ostream& operator<<(std::ostream& os, const mod::Int<MOD>& a) { return os << a.x;}

int dfs(ll n, vector<int>& dp) {
    if (dp[n] != -1) return dp[n];
    ll nn = n, cnt = 0;
    while (nn) {
        if (nn % 2 == 1) {
            cnt++;
        }
        nn /= 2;
    }
    dp[n] = dfs(n%cnt, dp) + 1;
    return dp[n];
}

void solve(long long N, std::string X){
    ll cnt1Large=0, cnt1Small=0, mod1=0, mod1Small=0;
    rep(i,0,N) {
        if (X[i] == '1') cnt1Large++;
    }
    cnt1Large++;
    cnt1Small = cnt1Large-2;
    rep(i,0,N) {
        if (X[i] == '0') continue;
        mod1 += mod::pow(2,N-i-1, cnt1Large);
        mod1 %= cnt1Large;
        if (cnt1Small>0) {
            mod1Small += mod::pow(2,N-i-1, cnt1Small);
            mod1Small %= cnt1Small;
        }
    }
    vector<int> dp(2e5+1, -1);
    dp[1]=1;
    dp[0]=0;
    rep(i,0,N) {
        if (X[i] == '0') {
            // cnt1Large
            ll n = mod1;
            n += mod::pow(2, N-i-1, cnt1Large);
            n %= cnt1Large;
            cout << dfs(n, dp) + 1 << endl;
        } else {
            if (cnt1Small == 0) {
                cout << 0 << endl;
                continue;
            }
            // cnt1Small
            ll n = mod1Small;
            n += cnt1Small;
            n -= mod::pow(2, N-i-1, cnt1Small);
            n %= cnt1Small;
            cout << dfs(n, dp) + 1 << endl;
        }
    }
}

signed main(){
    // ios_base::sync_with_stdio(false);
    // cin.tie(NULL);
    long long N;
    scanf("%lld",&N);
    std::string X;
    std::cin >> X;
    solve(N, X);
    return 0;
}


Measured memory_bytes: 4696