#define MOD_TYPE 1

#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using Int = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
*/

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
//constexpr ll MOD = 1;
constexpr int INF = (int)1e9 + 10;
constexpr ll LINF = (ll)4e18;
constexpr double PI = acos(-1.0);
constexpr double EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

inline void init_main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(30) << setiosflags(ios::fixed);
}
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
template <typename T, typename U>
constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept
{
  is >> p.first >> p.second;
  return is;
}
template <typename T, typename U>
constexpr ostream &operator<<(ostream &os, pair<T, U> &p) noexcept
{
  os << p.first << " " << p.second;
  return os;
}
#pragma endregion

int n;
int calc[200010];

void init()
{
  calc[0] = 0;
  REP(i, 1, n + 1)
  {
    int p = 0;
    rep(j, 30)
    {
      if (i & (1 << j))
        p++;
    }
    calc[i] = calc[i % p] + 1;
  }
}

void solve()
{
  cin >> n;
  init();
  string s;
  cin >> s;
  reverse(all(s));
  int p = 0;
  for (auto c : s)
  {
    if (c == '1')
      p++;
  }
  int d1 = 0, d2 = 0; //p-1,p+1
  int pow2 = 1;
  if (p > 1)
  {
    rep(i, n)
    {
      if (s[i] == '1')
        d1 = (d1 + pow2) % (p - 1);
      pow2 = pow2 * 2 % (p - 1);
    }
  }
  pow2 = 1;
  rep(i, n)
  {
    if (s[i] == '1')
      d2 = (d2 + pow2) % (p + 1);
    pow2 = pow2 * 2 % (p + 1);
  }

  //----------

  int p1 = 1, p2 = 1;
  vector<int> ans;
  rep(i, n)
  {
    if (s[i] == '0') //0->1
    {
      int d = (d2 + p1) % (p + 1);
      dbg(d);
      ans.push_back(calc[d] + 1);
    }
    else
    {
      if (p == 1)
      {
        ans.push_back(0);
      }
      else
      {
        int d = (d1 - p2 + p - 1) % (p - 1);
        dbg(d);
        ans.push_back(calc[d] + 1);
      }
    }
    p1 = p1 * 2 % (p + 1);
    if (p > 1)
      p2 = p2 * 2 % (p - 1);
  }
  for (int i = n - 1; i >= 0; i--)
    cout << ans[i] << "\n";
}

int main()
{
  init_main();
  solve();
}


Measured memory_bytes: 5316