#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

template< typename T >
T mod_pow(T x, T n, const T &p) {
  T ret = 1;
  while(n > 0) {
    if(n & 1) (ret *= x) %= p;
    (x *= x) %= p;
    n >>= 1;
  }
  return ret;
}
#pragma GCC target("avx2")
int main() {
  int N;
  string X;

  cin >> N;
  cin >> X;
  for(auto &p : X) p -= '0';

  vector< int > qs[2];
  for(int i = 0; i < N; i++) {
    qs[X[i]].emplace_back(i);
  }
  vector< int > ans(N);
  auto solve = MFP([&](auto solve, int val) {
    if(val == 0) return 0;
    return solve(val % __builtin_popcount(val)) + 1;
  });
  if(qs[0].size()) {
    int64 div = qs[1].size() + 1, val = 0;
    for(int i = 0; i < N; i++) {
      val = val * 2 + X[i];
      val %= div;
    }
    for(auto &p : qs[0]) {
      int64 add = mod_pow< int64 >(2, N - p - 1, div);
      add += val;
      add %= div;
      ans[p] = solve(add) + 1;
    }
  }
  if(qs[1].size()) {
    int64 div = qs[1].size() - 1, val = 0;
    for(int i = 0; i < N; i++) {
      val = val * 2 + X[i];
      if(div) val %= div;
      else val = 0;
    }
    for(auto &p : qs[1]) {
      int64 add = 0;
      if(div) add += div - mod_pow< int64 >(2, N - p - 1, div);
      add += val;
      if(div) add %= div;
      // all zero のときやばい大変なことになる
      if(qs[0].size() + 1 == N) ans[p] = 0;
      else ans[p] = solve(add) + 1;
    }
  }
  for(auto &p : ans) cout << p << "\n";
}


Measured memory_bytes: 5392