#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;



ll mult(ll x, ll y,ll mod) {
	return (x * y) % mod;
}
ll bin_pow(ll x, ll p, ll mod) {
	if (p == 0) return 1%mod;
	if (p & 1) return mult(x, bin_pow(x, p - 1,mod),mod);
	return bin_pow(mult(x, x,mod), p / 2,mod);
}

int calc(int n) {
	if (n == 0) return 0;
	int k = __builtin_popcount(n);
	n %= k;
	return 1 + calc(n);
}

void solve() {
	int N; cin >> N;
	string S; cin >> S;
	int cnt = 0;

	REP(i, N) {
		if (S[i] == '1')cnt++;
	}
	if (cnt == 0) {
		REP(_, N) {
			if (_ == N - 1)print(1);
			else print(0);
		}
	}
	else if (cnt == 1) {
		REP(i, N) {
			if (S[i] == '1')print(0);
			else if (i == N-1) {
				print(2);
			}
			else if (S[0] == '1')print(2);
			else print(1);
		}
	}
	else {
		VREVERSE(S);
		vector<vector<int>>cum(3,vector<int>(N + 1));
		vector<int>now = { 1,1,1 };
		vector<int>c = { cnt -  1,cnt,cnt + 1 };
		REP(i, N) {
			if (S[i] == '1') {
				REP(j, 3) {
					cum[j][i + 1] += now[j] % c[j];
				}
			}
			REP(j, 3) {
				cum[j][i + 1] += cum[j][i];
				now[j] *= 2;
				now[j] %= c[j];
			}
		}
		vector<int>ans(N);
		REP(i, N) {
			if (S[i] == '1') {
				int j = 0;
				int val = cum[j][i] + cum[j][N] - cum[j][i + 1];
				val %= c[j];
				//val += bin_pow(2, i, c[j]);
				val %= c[j];
				int res = 1;
				res += calc(val);
				ans[i] = res;
			}
			else {
				int j = 2;
				int val = cum[j][i] + cum[j][N] - cum[j][i + 1];
				val %= c[j];
				val += bin_pow(2, i, c[j]);
				val %= c[j];
				int res = 1;
				res += calc(val);
				ans[i] = res;
			}
		}
		REPR(i, N)print(ans[i]);
	}

}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//int q;
	//cin >> q;
	//while (q--)
	solve();
}


Measured memory_bytes: 9648