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

// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;

/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()

/* REPmacro */
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
#define EACH(i, n) for (auto&& i : n)

/* debug */
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n';

/* alias */
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using plglg = pair<ll, ll>;
using tlglglg = tuple<ll, ll, ll>;
using D = double;
using P = complex<D>;
using vs = vector<string>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;

/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};

/* func */
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; cin >> x; return x;}
inline ll IN() {ll x; cin >> x; return x;}
inline vs split(const string& t, char c) {vs v; stringstream s(t); string b; while(getline(s, b, c)) v.eb(b); return v;}
template <typename T> inline bool chmin(T& a, const T& b) {if (a > b) a = b; return a > b;}
template <typename T> inline bool chmax(T& a, const T& b) {if (a < b) a = b; return a < b;}
template <typename T, typename S> inline void print(const pair<T, S>& p) {cout << p.first << " " << p.second << endl;}
template <typename T> inline void print(const T& x) {cout << x << endl;}
template <typename T, typename S> inline void print(const vector<pair<T, S>>& v) {for (auto&& p : v) print(p);}
template <typename T> inline void print(const vector<T>& v, string s = " ") {REP(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");}
inline void yesno(bool ok, string yes = "Yes", string no = "No") {cout << (ok?yes:no) << endl;}


signed main() {
    //my-code
    // AIsing2020D
    int n; cin >> n;
    string x; cin >> x;
    int cnt1s = 0;
    REP(i, x.length()) {
        if(x[i]=='1')cnt1s++;
    }

    // print(cnt1s);  // DEBUG

    int p1 = cnt1s+1;
    int p2 = cnt1s-1;

    vi divp1(x.length()+5, 0), divp2(x.length()+5, 0);
    divp1[0] = 1;
    divp2[0] = 1;
    REP(i, x.length()+4) {
        divp1[i+1] = (divp1[i] * 2) % p1;
    }
    if (cnt1s == 1) {
        ;  // all 0
    } else {
        REP(i, x.length()+4) {
            divp2[i+1] = (divp2[i] * 2) % p2;
        }
    }

    // print(divp1);  // DEBUG
    // print(divp2);  // DEBUG

    int basemodp1 = 0;
    int basemodp2 = 0;
    DEP(i, x.length()-1) {
        if (x[i] == '1') {
            basemodp1 = (basemodp1 + divp1[x.length()-1-i]) % p1;
        }
    }
    if (cnt1s == 1) {
        basemodp2 = 0;
    } else {
        DEP(i, x.length()-1) {
            if (x[i] == '1') {
                basemodp2 = (basemodp2 + divp2[x.length()-1-i]) % p2;
            }
        }
    }

    map<int, int> jumpmp;
    REP(i, cnt1s+5) {
        int p = i;
        int cnt = 0;
        REP(j, 20) {
            if ( (p>>j) & 1 ) cnt++;
        }
        int q;
        if (cnt > 0) {
            q = p % cnt;
        } else {
            q = 0;
        }
        jumpmp[p] = q;
    }

    vi f(cnt1s+5, 0);
    REP(i, cnt1s+5) {
        if (i==0) continue;
        f[i] = f[jumpmp[i]] + 1;
    }

    vi ans(x.length());
    REP(i, x.length()) {
        if (x[i] == '1') {  // 1->0
            if (cnt1s == 1) {
                ans[i] = 0;
            } else {
                ans[i] = f[((basemodp2 - divp2[x.length()-1-i]) + p2) % p2] + 1;
            }
        } else {  // 0->1
            ans[i] = f[(basemodp1 + divp1[x.length()-1-i]) % p1] + 1;
        }
    }

    // print("=====");
    REP(i, x.length()) {
        print(ans[i]);
    }

    return 0;
}

// https://github.com/kurokoji/.cpp-Template/wiki テンプレートについて
// http://www.creativ.xyz/dump-cpp-652 dump()について
// https://gist.github.com/rigibun/7905920 色々

Measured memory_bytes: 10976