#include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#define bit(x) (1ll << (x))
#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE
#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)
using ll = long long;
//const ll MOD = (ll)1e9+7;
const ll MOD = 998244353;
const int INF = (ll)1e9+7;
const ll INFLL = (ll)1e18;
using namespace std;
template<class t>
using vvector = vector<vector<t>>;
template<class t>
using vvvector = vector<vector<vector<t>>>;
template<class t>
using priority_queuer = priority_queue<t, vector<t>, greater<t>>;
template<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}
template<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}
#ifdef DEBUG
#define debug(x) cout<<"LINE "<<__LINE__<<": "<<#x<<" = "<<x<<endl;
#else
#define debug(x) (void)0
#endif

namespace templates{
  ll modpow(ll x, ll b){
    ll res = 1;
    while(b){
      if(b&1)res = res * x % MOD;
      x = x * x % MOD;
      b>>=1;
    }
    return res;
  }

  ll modinv(ll x){
    return modpow(x, MOD-2);
  }

  bool was_output = false;
  template<class t>
  void output(t a){
    if(was_output)cout << " ";
    cout << a;
    was_output = true;
  }
  void outendl(){
    was_output = false;
    cout << endl;
  }
  ll in(){
    ll res;
    scanf("%lld", &res);
    return res;
  }

  template<class t>
  istream& operator>>(istream&is, vector<t>&x){
    for(auto &i:x)is >> i;
    return is;
  }

  template<class t, class u>
  istream& operator>>(istream&is, pair<t, u>&x){
    is >> x.first >> x.second;
    return is;
  }

  template<class t>
  void in(t&x){
    cin >> x;
  }

  template<class t>
  t in(){
    t res; cin >> res; return res;
  }

  template<class t>
  void out(t x){
    cout << x;
  }

  template<class t>
  vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){
    sort(line.begin(),line.end(),comp);
    return line;
  }

  template<class t>
  vector<t> reversed(vector<t> line){
    reverse(line.begin(),line.end());
    return line;
  }
}

using namespace templates;

vector<int> func(){
  int n = in();
  string str = in<string>();
  method(pop_count, int, string str){
    int res = 0;
    foreach(i,str){
      if(i=='1')++res;
    }
    return res;
  };

  method(parse_integer,int,string str,int mod){
    if(!mod)mod=1;
    int res = 0;
    foreach(ch,str){
      res = res * 2 + ch - '0';
      res %= mod;
    }
    return res;
  };


  method(func,int,int x){
    if(!x)return 0;
    return 1 + func(x%__builtin_popcount(x));
  };

  int pop_num = pop_count(str);

  if(pop_num==0){
    return vector<int> (n,1);
  }

  vector<int> pop_nums({pop_num+1,pop_num-1});
  vector<int> pow2(2,1);
  vector<int> res(n);
  vector<int> parsed({parse_integer(str,pop_num+1),parse_integer(str,pop_num-1)});

  per(i,n){
    int ch = str[i] - '0';
    if(!pop_nums[ch]){
      res[i] = 0;
    }else{
      int x = parsed[ch];
      int add = pow2[ch];
      if(ch)add=-add;
      x = (x + add) % pop_nums[ch];
      x += pop_nums[ch];
      x %= pop_nums[ch];
      res[i] = 1 + func(x);
    }
    rep(j,2){
      if(pop_nums[j]){
        pow2[j] = pow2[j] * 2 % pop_nums[j];
      }
    }
  }

  return res;
}

int main(){
  vector<int> ans = func();
  foreach(i,ans){
    cout << i << endl;
  }
}



Measured memory_bytes: 4592