#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////
ll op(ll n) {
	ll pop = 0;
	rep(i, 60) { if ((n >> i) & 1) { pop++; } }
	return (n % pop);
}

ll f(ll n) {
	if (n == 0) { return 0; }
	return f(op(n)) + 1;
}


int main() {

	ll N;
	cin >> N;
	string S;
	cin >> S;

	ll pop = 0;
	rep(i, N)if (S[i] == '1') { pop++; }
	//cout << pop << endl;

	vll amarip(N,0);
	amarip[N - 1] = 1;
	for (ll i = N - 2; i >= 0; i--) {
		amarip[i] = (amarip[i + 1] * 2) % (pop + 1);
	}

	vll amarim(N,0);
	amarim[N - 1] = 1;
	if (pop > 1) {
		for (ll i = N-2; i >= 0; i--) {
			amarim[i] = (amarim[i + 1] * 2) % (pop - 1);
		}
	}

	//rep(i, N) cout << amarip[i] << endl;
	//rep(i, N) cout << amarim[i] << endl;



	ll sump = 0;
	rep(i, N) if(S[i]=='1')sump += amarip[i];
	
	ll summ = 0;
	rep(i, N) if(S[i]=='1')summ += amarim[i];

	rep(i, N) {
		ll x;
		if (S[i] == '0') {
			x = sump + amarip[i];
			x %= (pop + 1);
		}
		if (S[i] == '1') {
			if (pop == 1) { cout << 0 << endl; continue; }
			x = summ - amarim[i];
			x %= (pop - 1);
		}

		//cout << x << " ";

		cout << f(x) + 1 << endl;
	}

}

Measured memory_bytes: 6744