import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.util.*
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min

val MOD = 1_000_000_007L

class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  fun solve() {
    val N = ni()
    val X = ns()
    val cnt = X.count{it == '1'}
    val m1 = cnt + 1

    val dp = IntArray(N + 1)
    dp[1] = 1
    for (i in 2 .. N) {
      val p = Integer.bitCount(i)
      dp[i] = dp[i % p] + 1
    }
    debug(dp)

    var s1 = 0L
    var rad1 = 1L
    for (i in N - 1 downTo 0) {
      if (X[i] == '1') {
        s1 = (s1 + rad1) % m1
      }
      rad1 = rad1 * 2 % m1
    }

    debug{"m1:$m1 s1:$s1"}

    val ans = IntArray(N)
    rad1 = 1L
    for (i in N - 1 downTo 0) {
      if (X[i] == '0') {
        ans[i] = dp[(s1 + rad1).toInt() % m1] + 1
      }
      rad1 = rad1 * 2 % m1
    }

    if (cnt > 1) {
      val m0 = cnt - 1
      var s0 = 0L
      var rad0 = 1L
      for (i in N - 1 downTo 0) {
        if (X[i] == '1') {
          s0 = (s0 + rad0) % m0
        }
        rad0 = rad0 * 2 % m0
      }

      debug{"m0:$m0 s0:$s0"}

      rad0 = 1L
      for (i in N - 1 downTo 0) {
        if (X[i] == '1') {
          ans[i] = dp[(m0 + s0 - rad0).toInt() % m0] + 1
        }
        rad0 = rad0 * 2 % m0
      }
    }

    for (i in ans) {
      out.println(i)
    }
  }













































  private val isDebug = try {
    // なんか本番でエラーでる
    System.getenv("MY_DEBUG") != null
  } catch (t: Throwable) {
    false
  }

  private var tokenizer: StringTokenizer? = null
  private val reader = BufferedReader(InputStreamReader(stream), 32768)
  private fun next(): String {
    while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
      tokenizer = StringTokenizer(reader.readLine())
    }
    return tokenizer!!.nextToken()
  }

  private fun ni() = next().toInt()
  private fun nl() = next().toLong()
  private fun ns() = next()
  private fun na(n: Int, offset: Int = 0): IntArray {
    return map(n) { ni() + offset }
  }
  private fun nal(n: Int, offset: Int = 0): LongArray {
    val res = LongArray(n)
    for (i in 0 until n) {
      res[i] = nl() + offset
    }
    return res
  }

  private fun na2(n: Int, offset: Int = 0): Array<IntArray> {
    val a  = Array(2){IntArray(n)}
    for (i in 0 until n) {
      for (e in a) {
        e[i] = ni() + offset
      }
    }
    return a
  }

  private inline fun map(n: Int, f: (Int) -> Int): IntArray {
    val res = IntArray(n)
    for (i in 0 until n) {
      res[i] = f(i)
    }
    return res
  }

  private inline fun debug(msg: () -> String) {
    if (isDebug) System.err.println(msg())
  }

  private fun debug(a: LongArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: IntArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: BooleanArray) {
    debug { a.map { if (it) 1 else 0 }.joinToString("") }
  }

  private fun debugDim(A: Array<LongArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }
  private fun debugDim(A: Array<IntArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }

  /**
   * 勝手にimport消されるのを防ぎたい
   */
  private fun hoge() {
    min(1, 2)
    max(1, 2)
    abs(-10)
  }
}

fun main() {
  val out = java.io.PrintWriter(System.out)
  Solver(System.`in`, out).solve()
  out.flush()
}

Measured memory_bytes: 49700