import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto N = RD;
	auto X = RD!string;

	long pc;
	foreach (i; 0..N)
	{
		if (X[i] == '1')
			++pc;
	}
	writeln("pc:", pc);

	if (pc == 0)
	{
		foreach (i; 0..N)
		{
			writeln(1);
		}
	}
	else if (pc == 1)
	{
		foreach (i; 0..N)
		{
			if (X[i] == '1')
				writeln(0);
			else
				writeln(1);
		}
	}
	else
	{
		auto to = new long[](N);
		foreach (ulong i; 1..N+1)
		{
			auto c = popcnt(i);
			to[i-1] = i % c;
		}

		auto rem = new long[][](N);
		long x = 1, y = 1;
		foreach (i; 0..N)
		{
			x %= pc-1;
			y %= pc+1;
			rem[i] = [x, y];
			x *= 2;
			y *= 2;
		}
		debug writeln(rem);

		long z1, z2, _z;
		foreach (i; 0..N)
		{
			if (X[i] == '1')
			{
				z1 += rem[N-i-1][0];
				z2 += rem[N-i-1][1];
				z1 %= pc-1;
				z2 %= pc+1;
				debug _z += 2^^(N-i-1);
			}
		}

		foreach (i; 0..N)
		{
			long zz, _zz, _zzz;
			if (X[i] == '1')
			{
				zz = (z1+pc-1) - rem[N-i-1][0];
				//debug writeln("zz:", zz);
				zz %= (pc-1);
				debug _zz = _z - 2^^(N-i-1);
				debug _zzz = (_zz % pc-1);
			}
			else
			{
				zz = z2 + rem[N-i-1][1];
				//debug writeln("zz:", zz);
				zz %= (pc+1);
				debug _zz = _z + 2^^(N-i-1);
				debug _zzz = (_zz % pc+1);
			}
			//debug writeln("_zz:", _zz, " _zzz:", _zzz);
			//debug writeln("zz:", zz);
			long ans = 1;
			while (zz != 0)
			{
				zz = to[zz-1];
				//debug writeln("zz:", zz);
				++ans;
			}
			writeln(ans);
		}
	}

	stdout.flush;
	debug readln;
}