#ifdef LOCAL
    #define _GLIBCXX_DEBUG
    #define __clock__
#else
    #pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair
#define p_yes() p("Yes")
#define p_no() p("No")

ll SUM(VI& V){
  return accumulate(ALL(V), 0LL);
}

ll MIN(VI& V){return *min_element(ALL(V));}
ll MAX(VI& V){return *max_element(ALL(V));}

void print_vector(VI& V){
  ll n = V.size();
  rep(i, n){
    if(i) cout << ' ';
    cout << V[i];
  }
  cout << endl;
}

ll gcd(ll a,ll b){
    if(b == 0) return a;
    return gcd(b,a%b);
}

ll lcm(ll a,ll b){
    ll g = gcd(a,b);
    return a / g * b;
}

// long double
using ld = long double;
#define EPS (1e-14)
#define equals(a,b) (fabs((a)-(b)) < EPS)

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

// snuke's mint
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
// const int mod = 1000000007;
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*(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;
  }
};

int popcount(signed t){
    return __builtin_popcount(t);
}
int popcount(ll t){
    return __builtin_popcountll(t);
}

// n <= 200000
VI memo;
ll f(ll n){
  if(memo[n]!=-1) return memo[n];
  ll cnt=0;
  while(n){
    cnt++;
    n %= popcount(n);
  }
  return cnt;
}

ll A[200010][3];
// [0] : pc-1
// [1] : pc
// [2] : pc+1

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N;
    cin>>N;
    string s;cin>>s;

    // nが小さいときの答え
    memo.resize(200010, -1);
    rep(i,200010){
      memo[i] = f(i);
    }
    assert(f(0)==0);
    assert(f(1)==1);
    assert(f(10)==1);

    ll pc = count(ALL(s), '1');

    // pcが0はつぶしておく
    if(pc==0){
      rep(i,N){
        p(1);
      }
      return 0;
    }

    // pc==1もつぶしておく
    if(pc==1){
      rep(i,N){
        if(s[i]=='1'){
          p(0);
        }else{
          // どこかが0->1になる
          if(s.back()=='1' or i==N-1){
            p(2);
          }else{
            p(1);
          }
        }
      }
      return 0;
    }
    
    // 以降、pc>1としてよい
    // （pc-1で割っても安心）
    debug(pc);

    auto g = [&](string& s, ll pc){
      ll N = SZ(s);
      if(pc==1) return 1LL;
      ll two = 1;
      ll sum=0;
      for(int i=N-1; i>=0; i--){
        // 今考えているbitの値がa
        if(s[i]=='1'){
          sum += two;
          sum %= pc;
        }
        two *= 2;
        two %= pc;
      }
      return sum;
    };

    // Xをpc-1, pc, pc+1で
    VI V(3);
    V[0] = g(s, pc-1); // X % (pc-1)
    V[1] = g(s, pc);   // X % pc
    V[2] = g(s, pc+1); // X % (pc+1)

    VI offset = {-1,0,1};
    rep(i,3){
      ll off = offset[i];
      ll v = 1;
      rep(p,200010){
        A[p][i] = v;
        v *= 2;
        v %= pc+off;
      }
    }

    rep(i,N){
      // sの上からi bit目を反転
      ll ans = -1;
      if(s[i]=='0'){
        // 2^pを足して考える
        ll m = pc+1;
        ans = V[2] + A[N-i-1][2];
        ans %= m;
      }else{
        // 2^pを引いて考える
        ll m = pc-1;
        ans = V[0] - A[N-i-1][0];
        ans %= m;
        if(ans<0) ans+=m;
      }
      
      ll cnt = 1+f(ans);
      p(cnt);
    }

    return 0;
}

Measured memory_bytes: 9824