local mfl, mce = math.floor, math.ceil
local n = io.read("*n", "*l")
local t = {}
local s = io.read()
local cnt1 = 0
for i = 1, n do
  t[i] = s:byte(i) == 49
  if t[i] then cnt1 = cnt1 + 1 end
end
local plusmap, minusmap = {}, {}
for i = 1, n do
  plusmap[i], minusmap[i] = 0, 0
end
do
  local dv = cnt1 + 1
  local mul = 1
  for i = n, 1, -1 do
    plusmap[i] = mul
    mul = (mul * 2) % dv
  end
end
if 2 < cnt1 then
  local dv = cnt1 - 1
  local mul = 1
  for i = n, 1, -1 do
    minusmap[i] = mul
    mul = (mul * 2) % dv
  end
end
local plus = 0
do
  local dv = cnt1 + 1
  for i = 1, n do
    if t[i] then
      plus = (plus + plusmap[i]) % dv
    end
  end
end
local minus = 0
if 1 < cnt1 then
  local dv = cnt1 - 1
  for i = 1, n do
    if t[i] then
      minus = (minus + minusmap[i]) % dv
    end
  end
end

local function firstdevide(p, dv)
  if t[p] then
    local currem = minus
    currem = (currem + dv - minusmap[p]) % dv
    return currem
  else
    local currem = plus
    currem = (currem + plusmap[p]) % dv
    return currem
  end
end

local function getpopcnt(x)
  local c = 0
  while 0 < x do
    if x % 2 == 1 then c = c + 1 end
    x = mfl(x / 2)
  end
  return c
end

for iq = 1, n do
  local dv = t[iq] and cnt1 - 1 or cnt1 + 1
  if dv == 0 then
    print(0)
  else
    local rem = firstdevide(iq, dv)
    local cnt = 1
    while 0 < rem do
      dv = getpopcnt(rem)
      rem = rem % dv
      cnt = cnt + 1
    end
    print(cnt)
  end
end
