#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
using namespace std; using ll = long long; using ld = long double;  using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using vpll = vector<pll>;
using vs = vector<string>; using tll = tuple<ll, ll, ll>; using vtll = vector<tll>;
const ld PI = 3.1415926535897932;
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define co(i) cout << i << endl;
#define co2(i,j) cout << i << " " << j << endl;
#define co3(i) cout << i << " ";
#define po(i) cout << i.first << " " << i.second << endl;
void in() {}
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
	cerr << " " << h;
	if (sizeof...(t) > 0) cerr << " :";
	debug_out(t...);
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> vec) {
	for (size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
ll ctoi(char c) {
	switch (c) {
	case '0': return 0; case '1': return 1; case '2': return 2;
	case '3': return 3; case '4': return 4; case '5': return 5;
	case '6': return 6; case '7': return 7; case '8': return 8;
	case '9': return 9;  default: return 0;
	}
}
bool pairCompare(const pll firstElof, pll secondElof)
{
	return firstElof.first > secondElof.first;
}
//**Snippetリスト**//
//rep, vin, all, iteLoop, bitSearch, bitList, nod, digitDP, treeDP//
//gcdlcm, isPrime, eratos, primeFactorize, Npow, combination, divisor, modinv, doubling//
//dfs, bfs, dijkstra, WarshallFloyd, BellmanFord, UnionFind, Kruskal, RMQ, LCA//
ll i, j, k, l; ll N, M, K, H, W, L, X, Y, Z, R, Q;
ll MOD = 1000000007, INF = 1LL << 60, ans = 0, z = 0, o = 1;
vl flag, D; vll path;
//***********//
ll MOD2;
ll Npow(ll x, ll n) {
	if (n == 0) return 1;
	if (n % 2 == 0) return Npow(x * x % MOD, n / 2);
	else return x * Npow(x, n - 1) % MOD;
}
ll Npow2(ll x, ll n) {
	if (n == 0) return 1;
	if (n % 2 == 0) return Npow2(x * x % MOD2, n / 2);
	else return x * Npow2(x, n - 1) % MOD2;
}

vl bitList(ll n, ll k, ll f) {
	vl bitList(k);
	for (ll i = 0; i < k; i++) {
		bitList[i] = f % n;
		f /= n;
	}
	return bitList;
}
int main() {
	string X;
	cin >> N >> X;
	vl A(N);
	ll base = 0;
	for (i = 0; i < N; i++) {
		if (X[i] == '1') {
			A[i] = 1;
			base++;
		}
		else A[i] = 0;
	}
	//非反転時のmod base-1,base+1のあまり
	MOD = base - 1; MOD2 = base + 1;
	ll zero = 0;
	if (MOD == 0) {
		MOD = 1;
		zero = 1;
	}
	ll pre = 0, pre2 = 0;
	for (i = 0; i < N; i++) {
		if (A[i]) {
			(pre += Npow(2, N - i - 1)) %= MOD;
			(pre2 += Npow2(2, N - i - 1)) %= MOD2;
		}
	}
	//1~Nの操作後の遷移保存
	vl L(N + 1);
	for (k = 1; k <= N; k++) {
		vl B = bitList(2, 20, k);
		ll b = 0;
		for (i = 0; i < 20; i++) if (B[i]) b++;
		if (b == 0) L[k] = -1;
		else L[k] = k % b;
	}
	//debug(L);
	for (i = 0; i < N; i++) {
		ll first = 0;
		if (A[i] == 0) {
			first = pre2;
			(first += Npow2(2, N - i - 1)) %= MOD2;
		}
		else {
			first = pre;
			first = ((first-Npow(2, N - i - 1)+MOD)%MOD+MOD*10) % MOD;
			if (zero) first = 0;
		}
		//debug(first);
		ll ans = 1;
		if (zero && A[i] == 1) ans = 0;
		else {
			ll next = first;
			while (next > 0) {
				//debug(next);
				ans++;
				ll now = next;
				next = L[now];
			}
		}
		co(ans);
	}
}

Measured memory_bytes: 6740