import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
 
public class Main {
 
    void solve() throws IOException {
        int N = ni();
        String S = ns();
        int pc = 0;
        for (int i = 0; i < N; i++) {
            if(S.charAt(i)=='1')pc++;
        }
        if(pc==0){
            for (int i = 0; i < N; i++) {
                out.println(1);
            }
            return;
        }
        int[] tensMpl = new int[N];
        tensMpl[0] = 1;
        for (int i = 1; i < N; i++) {
            tensMpl[i] = (tensMpl[i-1] * 2) % (pc+1);
        }
        int[] tensMmi = new int[N];
        tensMmi[0] = 1;
        for (int i = 1; i < N; i++) {
            if(pc>1)tensMmi[i] = (tensMmi[i-1] * 2) % (pc-1);
        }
        int mpl = 0;
        int mmi = 0;
        for (int i = 0; i < N; i++) {
            if(S.charAt(i)=='1') {
                mpl += tensMpl[N-i-1];
                mpl = mpl % (pc+1);
                if(pc>1){
                    mmi += tensMmi[N-i-1];
                    mmi = mmi % (pc-1);
                }
            }
        }
        for (int i = 0; i < N; i++) {
            if(pc==1 && S.charAt(i)=='1'){
                out.println(0);
                continue;
            }
            int count = 1;
            if(S.charAt(i)=='0'){
                int m = (mpl + tensMpl[N-i-1]) % (pc+1);
                while(m>0){
                    m = m % Integer.bitCount(m);
                    count++;
                }
                out.println(count);
            }else{
                int m = (mmi + (pc-1)- tensMmi[N-i-1]) %  (pc-1);
                if(m < 0) m += (pc-1);
                if(m>=pc-1) m -= (pc-1);
                while(m>0){
                    m = m % Integer.bitCount(m);
                    count++;
                }
                out.println(count);
            }
        }
    }

    final int mod = 1000000007;
    final BigInteger MOD = BigInteger.valueOf(mod);
    int upperBound(ArrayList<Long> list, Long target){
        int i = Collections.binarySearch(list, target, new UpperBoundComparator<Long>());
        return ~i;
    }
    class UpperBoundComparator<T extends Comparable<? super T>> implements Comparator<T>{
        public int compare(T x, T y){
            return (x.compareTo(y) > 0) ? 1 : -1;
        }
    }
    int lowerBound(ArrayList<Long> list, Long target){
        int i = Collections.binarySearch(list, target, new LowerBoundComparator<Long>());
        return ~i;
    }
    class LowerBoundComparator<T extends Comparable<? super T>> implements Comparator<T>{
        public int compare(T x, T y){
            return (x.compareTo(y) >= 0) ? 1 : -1;
        }
    }
    int mul(int x, int y){
        int val = (int)((x * 1L * y) % mod);
        return val>=0 ? val : val+mod;
    }
    int add(int x, int y) {
        x += y;
        if(x < 0) x += mod;
        if(x>=mod) x -= mod;
        return x;
    }
    int sub(int x, int y){
        x = add(x,mod-y);
        if(x < 0) x += mod;
        if(x>=mod) x -= mod;
        return x;
    }
    String ns() throws IOException {
        while (!tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine(), " ");
        }
        return tok.nextToken();
    }
 
    int ni() throws IOException {
        return Integer.parseInt(ns());
    }
 
    long nl() throws IOException {
        return Long.parseLong(ns());
    }
 
    double nd() throws IOException {
        return Double.parseDouble(ns());
    }
 
    String[] nsa(int n) throws IOException {
        String[] res = new String[n];
        for (int i = 0; i < n; i++) {
            res[i] = ns();
        }
        return res;
    }
 
    int[] nia(int n) throws IOException {
        int[] res = new int[n];
        for (int i = 0; i < n; i++) {
            res[i] = ni();
        }
        return res;
    }
 
    long[] nla(int n) throws IOException {
        long[] res = new long[n];
        for (int i = 0; i < n; i++) {
            res[i] = nl();
        }
        return res;
    }
 
    static BufferedReader in;
    static PrintWriter out;
    static StringTokenizer tok;
 
    public static void main(String[] args) throws IOException {
        in = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        tok = new StringTokenizer("");
        Main main = new Main();
        main.solve();
        out.close();
    }
}

Measured memory_bytes: 53116