D.cpp

/*
 © 2020-07-11 06:54:04 Franco1010 All Rights Reserved
*/

#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(s) int(s.size())
#define ENDL '\n'
using namespace std;
typedef long double ld;
typedef long long lli;
typedef pair<lli,lli> ii;
typedef vector<lli> vi;
#define deb(x) cout << #x": " << (x) << endl;
const int N = 2e5 + 5;
lli m[2][N];
lli f(lli x){
  lli res = 1;
  while(x > 0){
    x %= __builtin_popcountll(x);
    res++;
  }
  return res;
}
int main(){ _
  lli n; string x; cin >> n >> x;
  lli cnt = 0;
  fore(i, 0, n){
    cnt += x[i] == '1';
  }
  lli cur = 1;
  if(cnt > 1){
    fore(i, 0, n){
      cur %= (cnt - 1ll);
      m[0][n - i - 1] = cur;
      cur <<= 1ll;
    }
  }
  cur = 1;
  fore(i, 0, n){
    cur %= (cnt + 1ll);
    m[1][n - i - 1] = cur;
    cur <<= 1ll;
  }
  lli acu0 = 0, acu1 = 0;
  fore(i, 0, n) if(x[i] == '1') acu0 += m[0][i];
  fore(i, 0, n) if(x[i] == '1') acu1 += m[1][i];
  // fore(i, 0, n) cout << m[0][i] << ' '; cout << ENDL;
  // fore(i, 0, n) cout << m[1][i] << ' ' ; cout << ENDL;
  // cout << acu0 << ' ' << acu1 << ENDL;
  fore(i, 0, n){
    if(x[i] == '1'){
      if(cnt == 1) cout << 0 << ENDL;
      else if(cnt == 2) cout << 1 << ENDL;
      else cout << f((acu0 - m[0][i]) % (cnt - 1ll)) << ENDL;
    }else{
      if(cnt == 0) cout << 1 << ENDL;
      else cout << f((acu1 + m[1][i]) % (cnt + 1ll)) << ENDL;
    }
  }
  return 0;
}