#define _CRT_SECURE_NO_WARNINGS
#define REL

#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <iomanip>
#include <cstdio>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <string>
#include <set>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <cassert>
#include <complex>
#include <stack> 
#include <random>

using namespace std;

typedef int64_t i64;
typedef long long LL;
typedef long long ll;
typedef long double LD;
typedef complex <LD> cld;
typedef unsigned int uint;
typedef complex <double> cd;
typedef unsigned long long ULL;

#define endl "\n"
#define dendl "\n\n"
#define mp make_pair
#define mt make_tuple
#define size(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

/////////////////////////////////////////////////////////////////////

template <typename T>
T sqr(T a) {
	return a * a;
}

template <typename T>
int sign(T a) {
	if (a == 0)
		return 0;
	return (a > 0 ? 1 : -1);
}

template <typename T>
bool uax(T& a, const T b) {
	if (a < b) {
		a = b;
		return true;
	}
	return false;
}

template <typename T>
bool uin(T& a, const T b) {
	if (a > b) {
		a = b;
		return true;
	}
	return false;
}

template <typename T1, typename T2>
istream& operator >> (istream& in, pair<T1, T2>& p) {
	in >> p.first >> p.second;
	return in;
}

template <typename T1, typename T2>
ostream& operator << (ostream& out, pair<T1, T2>& p) {
	out << p.first << ' ' << p.second;
	return out;
}

mt19937_64 rnd(0);

const int LOG = 64;
const int N = (int)2e5 + 7;
const int MAXN = (int)1e6 + 7;
const int MOD = (int)1e9 + 7;
const int INF = (int)2e9 + 7;
const int CONST = 450;
const LL LINF = (i64)1e18;
const LD PI = 3.1415926535897932384626433832795;
const LD EPS = 1;

/////////////////////////////////////////////////////////////////////

int sub(int a, int b, int mod) {
	if (mod == 0)
		return 0;
	return (a - b + mod) % mod;
}

int add(int a, int b, int mod) {
	if (mod == 0)
		return 0;
	return (a + b) % mod;
}

int mul(int a, int b, int mod) {
	return 1LL * a * b % mod;
}

int bin_pow(int a, int p, int mod) {
	if (mod == 0)
		return 0;
	int res = 1;
	while (p) {
		if (p & 1)
			res = mul(res, a, mod);
		a = mul(a, a, mod);
		p >>= 1;
	}
	return res;
}

int count(int x) {
	int res = 0;
	while (x)
		res += x & 1, x >>= 1;
	return res;
}

int get(int x) {
	int res = 0;
	while (x) {
		res++;
		x = x % count(x);
	}
	return res;
}

void solve() {
	int n; cin >> n;
	string s; cin >> s;
	int mod1 = 0, mod2 = 0;
	for (int i = 0; i < n; i++) {
		if (s[i] == '1')
			mod1++, mod2++;
	}
	if (mod1 == 0) {
		for (int i = 0; i < n; i++)
			cout << "1\n";
		return;
	}
	mod1++, mod2--;
	int rem1 = 0, rem2 = 0;
	for (int i = 0; i < n; i++) {
		if (s[i] == '0')
			continue;
		rem1 = add(rem1, bin_pow(2, n - i - 1, mod1), mod1);
		rem2 = add(rem2, bin_pow(2, n - i - 1, mod2), mod2);
	}
	for (int i = 0; i < n; i++) {
		if (s[i] == '0')
			cout << get(add(rem1, bin_pow(2, n - i - 1, mod1), mod1)) + 1 << endl;
		else
			cout << (mod2 == 0 ? 0 : get(sub(rem2, bin_pow(2, n - i - 1, mod2), mod2)) + 1) << endl;
	}
}

int main() {
	double start = clock();
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	cout << fixed << setprecision(20);
	cerr << fixed << setprecision(20);
#else
	cout << fixed << setprecision(20);
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	rnd.seed(time(0));
#endif

	int t = 1;
	for (int i = 0; i < t; i++) {
		solve();
	}

#ifdef _DEBUG
	cout << endl << "Time is " << (clock() - start) / 1000.0;
#endif
}

Measured memory_bytes: 3780