package main

import (
	"bufio"
	"fmt"
	"io"
	"math/bits"
	"os"
	"strconv"
)

const mod = 998244353
const facNum = 300001

var dp []int

func main() {
	sc := newScanner(os.Stdin)
	N := sc.i()
	X := sc.s()

	// popcount
	dp = make([]int, 1000000)
	p := popcountStr(X)
	b0 := make([]int, N)
	b1 := make([]int, N)
	p0 := p + 1
	p1 := 1
	if p > 1 {
		p1 = p - 1
	}
	b0[0] = 1 % (p0)
	b1[0] = 1 % (p1)
	for i := 1; i < N; i++ {
		b0[i] = b0[i-1] * 2 % p0
		b1[i] = b1[i-1] * 2 % p1
	}
	x0, x1 := 0, 0
	for i := 0; i < N; i++ {
		if X[N-1-i] == '1' {
			x0 += b0[i]
			x0 %= p0
			x1 += b1[i]
			x1 %= p1
		}
	}

	for i := 0; i < N; i++ {
		ni := N - 1 - i
		z := 0
		if X[i] == '0' {
			z = x0 + b0[ni]
			z %= p0
			z = 1 + f(z)
		} else {
			z = x1 - b1[ni]
			if z < 0 {
				z += p1
			}
			z %= p1
			z = 1 + f(z)
			if p == 1 {
				z = 0
			}
		}
		fmt.Println(z)
	}
}

func popcount(x int) int {
	return bits.OnesCount(uint(x))
}

func popcountStr(x string) int {
	ans := 0
	for _, r := range x {
		if r == '1' {
			ans++
		}
	}
	return ans
}

func f(x int) int {
	if x <= 0 {
		return 0
	}
	//if dp[x] != 0 {
	//	return dp[x]
	//}
	nx := x % popcount(x)
	ans := f(nx) + 1
	//dp[x] = ans
	return ans
}

// fmt.Println("Yes")
// fmt.Println("No")

// I/O
type scanner struct {
	sc *bufio.Scanner
}

func newScanner(input io.Reader) *scanner {
	sc := bufio.NewScanner(input)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024), int(1e+9))
	return &scanner{sc}
}

func (s *scanner) s() string {
	s.sc.Scan()
	return s.sc.Text()
}

func (s *scanner) i() int {
	i, e := strconv.Atoi(s.s())
	if e != nil {
		panic(e)
	}
	return i
}

func (s *scanner) f() float64 {
	f, e := strconv.ParseFloat(s.s(), 64)
	if e != nil {
		panic(e)
	}
	return f
}

func (s *scanner) bs() []byte {
	return []byte(s.s())
}

func (s *scanner) is(n int) []int {
	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = s.i()
	}
	return res
}

func (s *scanner) fs(n int) []float64 {
	res := make([]float64, n)
	for i := 0; i < n; i++ {
		res[i] = s.f()
	}
	return res
}

//------------------------------

//const factorial = new
func Pow(a, n int) int {
	ans := 1
	for n > 0 {
		if (n & 1) == 1 {
			ans = ans * a % mod
		}
		a = a * a % mod
		n = n >> 1
	}
	return ans
}

// a^{-1} (mod) を計算
func Inv(a int) int {
	return Pow(a, mod-2)
}

func Gcd(a, b int) int {
	if a < b {
		return Gcd(b, a)
	}
	for b != 0 {
		a, b = b, a%b
	}
	return a
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func combination(n, k int, fac, ifac []int) int {
	if n < k || n < 0 {
		return 0
	}
	if k == 0 {
		return 1
	}
	//while n != 0
	ans := ifac[k] * ifac[n-k] % mod
	return ans * fac[n] % mod
}

func abs(i int) int {
	if i < 0 {
		return -i
	}
	return i
}

// 階乗: factorial
// コンビネーションを計算する際に前もって計算しておく
// fac[k] => k! (mod M)
// ifac[k] => k!^(M-2) (mod M)
// n: ex. 2 * 10^5 => 200001
// fac, ifac := factorial()
func factorial() (fac []int, ifac []int) {
	fac = make([]int, facNum)
	fac[0] = 1
	ifac = make([]int, facNum)
	ifac[0] = 1
	for i := 1; i < facNum; i++ {
		fac[i] = fac[i-1] * i % mod
		ifac[i] = ifac[i-1] * Pow(i, mod-2) % mod
	}
	return
}

// vs: sorted slice int value
func lowerBound(vs []int, v int) (index int) {
	n := len(vs) / 2
	m := len(vs)
	for m != n {
		if vs[n] < v {
			n = (m-n+1)/2 + n
			//m = m
		} else {
			m = n
			n = n / 2
		}
	}
	return n
}

func IntSlice(n, init int) []int {
	r := make([]int, n)
	for i := range r {
		r[i] = init
	}
	return r
}


Measured memory_bytes: 7180