#include <bits/stdc++.h>

using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'


const int MAXN = 555555;

vl fact(MAXN);
vl rfact(MAXN);

ll mod_pow(ll x, ll p, ll M = MOD) {
  if (p < 0) {
    x = mod_pow(x, M - 2, M);
    p = -p;
  }
  ll a = 1;
  while (p) {
    if (p % 2)
      a = a*x%M;
    x = x*x%M;
    p /= 2;
  }
  return a;
}

ll mod_inverse(ll a, ll M = MOD) {
  return mod_pow(a, M - 2, M);
}

void set_fact(ll n, ll M = MOD) {
  fact[0] = 1;
  for (ll i = 1; i <= n; i++) {
    fact[i] = i * fact[i - 1] % M;
  }
  rfact[n] = mod_inverse(fact[n], M);
  for (ll i = n - 1; i >= 0; i--) {
      rfact[i] = (i + 1) * rfact[i + 1] % M;
  }
}

//http://drken1215.hatenablog.com/entry/2018/06/08/210000
//n���傫��fact���v�Z�ł��Ȃ��Ƃ��̂ق��̌v�Z���@�ɂ��ď����Ă���
ll nCr(ll n, ll r, ll M = MOD) {
  if (r > n) return 0;
  assert(fact[2] == 2);
  ll ret = fact[n];
  if (rfact[r] == 0) {
    rfact[r] = mod_inverse(fact[r], M);
  }
  ret = (ret*rfact[r]) % M;
  if (rfact[n - r] == 0) {
    rfact[n - r] = mod_inverse(fact[n - r], M);
  }
  ret = (ret*rfact[n - r]) % M;
  return ret;
}

ll nHr(ll n, ll r) {
  return nCr(n+r-1, r);
}

struct dice {
  mt19937 mt;
  dice() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
  // [0, x)の一様乱数
  ll operator()(ll x) { return this->operator()(0, x); }
  // [x, y)の一様乱数
  ll operator()(ll x, ll y) {
    uniform_int_distribution<ll> dist(x, y - 1);
    return dist(mt);
  }
  vl operator()(int n, ll x, ll y) {
    vl res(n);
    for (int i = 0; i < n; i++) res[i] = this->operator()(x, y);
    return res;
  }
} rnd;

signed main() {
    int n;
    cin >> n;
    vi ans(222222);
    for (int m = 1; m < 211111; m++) {
        ll x = m;
        while (x > 0) {
            int cnt = 0;
            rep (i, 60) {
                ll mask = 1LL << i;
                if (x & mask) cnt++;
            }
            ans[m]++;
            x %= cnt;
        }
    }

    string x;
    cin >> x;
    int num = 0;
    rep (i, n) num += x[i] == '1';

    vi base(2);
    rep (i, 2) {
        int mod = num;
        if (i == 0) mod--;
        else mod++;

        rep (j, n) {
            if (x[j] == '1' and mod != 0) {
                base[i] += mod_pow(2, n - 1 - j, mod);
                base[i] %= mod;
            }
        }
    }

    rep (i, n) {
        int mod = num;
        int idx;
        if (x[i] == '1') {
            mod--;
            idx = 0;
        }
        else {
            mod++;
            idx = 1;
        }

        if (mod == 0) {
            cout << 0 << '\n';
            continue;
        }

        int temp = base[idx];
        if (x[i] == '1') temp -= mod_pow(2, n - 1 - i, mod);
        else temp += mod_pow(2, n - 1 - i, mod);
        temp = (temp % mod + mod) % mod;
        assert(0 <= temp and temp < mod);
        cout << 1 + ans[temp] << '\n';
    }
}

// void solve() {
//     int n;
//     cin >> n;
//     using P = pair<pii, pii>;
//     vector<P> sklr(n);
//     rep (i, n) {
//         int k, l, r;
//         cin >> k >> l >> r;
//         sklr[i] = P(pii(r - l, k), pii(l, r));
//     }
//     sort(all(sklr));
//     reverse(all(sklr));

//     set<int> st;
//     rep (i, n) st.insert(i);

//     ll ans = 0;
//     rep (i, n) {
//         int k = sklr[i].first.second;
//         auto itr = st.lower_bound(k);
//         int score = 0;
//         if (itr == st.begin()) {
//             score = sklr[i].second.first;
//             itr = st.end();
//         }
//         else {
//             score = sklr[i].second.second;
//         }
//         itr--;
//         ans += score;
//         st.erase(itr);
//     }
//     cout << ans << endl;
// }


// signed main() {
//     fio();
//     int t;
//     cin >> t;
//     while (t--) {
//         solve();
//     }
// }

Measured memory_bytes: 14092