#pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP1(i, n) for (ll i = 1; i <= (n); ++i)
#define FOR(i, a) for (auto &i : a)
#define CH(f, x, y) x = f(x, y)
#define IN(T, x) \
    T x;         \
    cin >> x;
#define AIN(T, a, n) \
    vector<T> a(n);  \
    FOR(i, a)        \
    cin >> i;
#define A2IN(T1, a, T2, b, n) \
    vector<T1> a(n);          \
    vector<T2> b(n);          \
    REP(i, n)                 \
    cin >> a[i] >> b[i];
#define OUT(x) cout << (x) << endl;
#define FOUT(x) cout << fixed << setprecision(15) << (x) << endl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
    SORT(a);     \
    reverse(ALL(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define DUMPA(a)          \
    cout << #a << " = {"; \
    JOUT(ALL(a), ", ", cout) << "}" << endl;

template <typename T>
ostream &JOUT(T s, T e, string sep = " ", ostream &os = cout)
{
    if (s != e)
    {
        os << *s;
        ++s;
    }
    while (s != e)
    {
        os << sep << *s;
        ++s;
    }
    return os;
}

ostream &YES(bool cond, string yes = "Yes", string no = "No", ostream &os = cout)
{
    if (cond)
    {
        os << yes << endl;
    }
    else
    {
        os << no << endl;
    }
    return os;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
    os << '(' << p.first << ", " << p.second << ')';
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
    os << '[';
    JOUT(ALL(v), ", ", os) << ']';
    return os;
}

const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#pragma endregion template

int main()
{
    IN(ll, N);
    IN(string, X);
    ll m = 0;
    REP(i, N)
    {
        m += X[i] - '0';
    }
    ll a = 0;
    ll b = 0;
    vi ka(N), kb(N);
    for (ll i = N - 1; i >= 0; --i)
    {
        if (i == N - 1)
        {
            ka[i] = 1;
        }
        else
        {
            ka[i] = (ka[i + 1] * 2) % (m + 1);
        }
        a = (a + (X[i] - '0') * ka[i]) % (m + 1);
        if (m > 1)
        {
            if (i == N - 1)
            {
                kb[i] = 1;
            }
            else
            {
                kb[i] = (kb[i + 1] * 2) % (m - 1);
            }
            // DUMP(b);
            // DUMP(X[i] - '0');
            // DUMP(kb[i]);
            // DUMP((b + (X[i] - '0') * kb[i]));
            b = (b + (X[i] - '0') * kb[i]) % (m - 1);
        }
        // DUMP(b);
    }
    vi dp(N + 1);
    REP1(i, N)
    {
        dp[i] = 1 + dp[i % __builtin_popcount(i)];
    }
    // DUMP(kb);
    // DUMP(m);
    // DUMP(a);
    // DUMP(b);
    // DUMP(dp);
    REP(i, N)
    {
        ll ans;
        if (X[i] == '1')
        {
            if (m == 1)
            {
                OUT(0);
                continue;
            }
            // DUMP((((b - kb[i]) % (m - 1)) + m - 1) % (m - 1));
            OUT(dp[(((b - kb[i]) % (m - 1)) + m - 1) % (m - 1)] + 1);
        }
        else
        {
            OUT(dp[(a + ka[i]) % (m + 1)] + 1);
        }
    }
}

Measured memory_bytes: 8408