#include <bits/stdc++.h>
template <class T>
bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
using namespace std;
template <class T>
void view(T e) {
  cout << e << endl;
}
template <class T>
void view(const vector<T> &v) {
  for (const auto &e : v) {
    cout << e << " ";
  }
  cout << endl;
}
template <class T>
void view(const vector<vector<T>> &vv) {
  for (const auto &v : vv) {
    view(v);
  }
}
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int, int>;
const int inf = 1e9;
const ll inf_l = 1e18;
const int MAX = 1e5;
ll modpow(ll base, ll exp, ll mod) {
  ll res = 1;
  while (exp > 0) {
    if (exp & 1) res = res * base % mod;
    base = base * base % mod;
    exp >>= 1;
  }
  return res;
}
int f(string s, int div) {
  int n = s.size();
  ll x = 0;
  for (int i = 0; i < (int)(n); i++) {
    if (s[i] == '1') {
      x += modpow(2, n - 1 - i, div);
      x %= div;
    }
  }
  return x % div;
}
int f_(int x, int ct = 1) {
  if (x == 0) return ct;
  int tmp = x % __builtin_popcount(x);
  if (tmp == 0) return ct + 1;
  return f_(tmp, ct + 1);
}
int main() {
  int n;
  cin >> n;
  string s;
  cin >> s;
  int div = 0;
  for (int i = 0; i < (int)(n); i++)
    if (s[i] == '1') div++;
  int x_plus = f(s, div + 1);
  int x_minus;
  if (div - 1 != 0) x_minus = f(s, div - 1);
  for (int i = 0; i < (int)(n); i++) {
    if (s[i] == '0') {
      ll x = x_plus + modpow(2, n - 1 - i, div + 1);
      x %= div + 1;
      printf("%d\n", f_(x));
    }
    if (s[i] == '1') {
      if (div - 1 == 0)
        cout << 0 << endl;
      else {
        ll x = x_minus - modpow(2, n - 1 - i, div - 1);
        if (x < 0) x += div - 1;
        x %= div - 1;
        printf("%d\n", f_(x));
      }
    }
  }
}
