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

// エイリアス
using  ll = long signed long;
using ull = long unsigned long;
using  ld = long double;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;

// 汎用マクロ
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define FOREACH(i,q) for (auto &i : q)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
#define SZ(x) ((int)(x).size())
template <class T>inline bool chmin(T &a, const T b) {if (a > b) { a = b; return true;} return false;}
template <class T>inline bool chmax(T &a, const T b) {if (a < b) { a = b; return true;} return false;}

const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 28;
const ll INF64 = 1ll << 60;
const int mod = 1000000007;
//const int mod = 998244353;
struct mint
{
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint a)
  {
    if ((x += a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator-=(const mint a)
  {
    if ((x += mod - a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator*=(const mint a)
  {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const
  {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const
  {
    mint res(*this);
    return res -= a;
  }
  mint &operator++()
  {
    if ((x += 1) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator--()
  {
    if ((x += mod - 1) >= mod)
      x -= mod;
    return *this;
  }
  mint operator*(const mint a) const
  {
    mint res(*this);
    return res *= a;
  }
  mint pow(ll t) const
  {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const
  {
    return pow(mod - 2);
  }
  mint &operator/=(const mint a)
  {
    return (*this) *= a.inv();
  }
  mint operator/(const mint a) const
  {
    mint res(*this);
    return res /= a;
  }
};

template <class T>inline void line_out(const vector<T> vec) {
  int n = SZ(vec);
  rep(i, n) {
    cout << vec[i];
    if(i < n-1) cout << " ";
  }
  cout << endl;
  return;
}

int main()
{
  int n;
  string s;
  cin >> n >> s;
  int init_pop = bitset<200000>(s).count();
  vector<int> inc_num(n), dec_num(n);
  int inc = 0, dec = 0;
  int x = 1;
  reverse(ALL(s));
  rep(i, n) {
    if(s[i] == '1') {
      inc += x;
      inc %= init_pop+1;
    }
    inc_num[i] = x;

    x *= 2;
    x %= init_pop+1;
  }
  x = 1;
  if(init_pop > 1) {
    rep(i, n) {
      if(s[i] == '1') {
        dec += x;
        dec %= init_pop-1;
      }
      dec_num[i] = x;

      x *= 2;
      x %= init_pop-1;
    }
  }

  vector<int> ans(n);

  rep(i, n) {
    if(s[i] == '1') {
      if(init_pop == 1) ans[i] = 0;
      else if(init_pop == 2) ans[i] = 1;
      else {
        int num = dec-dec_num[i];
        num += init_pop-1;
        num %= init_pop-1;
        int res = 1;
        while(num > 0) {
          ++res;
          num %= bitset<30>(num).count();
        }
        ans[i] = res;
      }
    }
    else {
      int num = (inc + inc_num[i])%(init_pop+1);
      int res = 1;
      while(num > 0) {
        ++res;
        num %= bitset<30>(num).count();
      }
      ans[i] = res;
    }
  }
  reverse(ALL(ans));

  for(auto x : ans) cout << x << endl;
}

Measured memory_bytes: 5984