#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m, ll M) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2, M);
    return (tmp * tmp) % M;
  } else {
    return (n * POW(n, m - 1, M)) % M;
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

vl DP(300010, llINF);

ll f(ll now) {
  if (now == 0)
    return 0;
  if (DP[now] != llINF)
    return DP[now];
  ll po = __builtin_popcount(now);
  DP[now] = f(now % po) + 1;
  return DP[now];
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  string X;
  cin >> X;
  REP(i, 200005) { f(i); }
  ll count = 0;
  DP[0] = 0;

  REP(i, N) if (X[i] == '1') count++;
  ll all_p = 0;
  ll all_m = 0;
  // cout << count << endl;

  REP(i, N) {
    if (X[N - 1 - i] == '1') {
      all_p = (POW(2, i, count + 1) + all_p) % (count + 1);
      if (count - 1 > 0)
        all_m = (POW(2, i, count - 1) + all_m) % (count - 1);
    }
  }
  // cout << all_p << "," << all_m << endl;
  vl A(N + 1);
  REP(i, N) {
    ll M = count;
    if (X[N - 1 - i] == '1') {
      M--;
      if (M == 0)
        A[N - 1 - i] = 0;
      else
        A[N - 1 - i] = DP[(all_m + M - POW(2, i, M)) % M] + 1;
    } else {
      M++;
      A[N - 1 - i] = DP[(all_p + POW(2, i, M)) % M] + 1;
    }
  }
  REP(i, N) cout << A[i] << endl;

  return 0;
}


Measured memory_bytes: 7532