import java.io.FileInputStream;
import java.io.PrintWriter;
import java.io.InputStream;
import java.util.InputMismatchException;
import java.io.FileNotFoundException;
import java.io.IOException;

public class Main {
    InputStream is;

    int __t__ = 1;
    int __f__ = 0;
    int __FILE_DEBUG_FLAG__ = __f__;
    String __DEBUG_FILE_NAME__ = "src/main/java/D2";

    FastScanner in;
    PrintWriter out;

    public void solve() {
        int n = in.nextInt();
        char[] s = in.next().toCharArray();

        int bits = 0;
        for (int i = 0; i < n; i++) {
            if (s[i] == '1') bits++;
        }
        int[] low = new int[n];
        int[] high = new int[n];

        low[0] = 1;
        high[0] = 1;
        for (int i = 1; i < n; i++) {
            low[i] = (low[i-1] * 2) % Math.max(bits - 1, 1);
            high[i] = (high[i-1] * 2) % (bits + 1);
        }

        int sumL = 0;
        int sumR = 0;
        for (int i = 0; i < n; i++) {
            if (s[i] == '1') {
                sumL = (sumL + low[n-i-1]) % Math.max(bits - 1, 1);
                sumR = (sumR + high[n-i-1]) % (bits + 1);
            }
        }

        for (int i = 0; i < n; i++) {
            int cur;
            if (s[i] == '0') {
                // System.out.println("b0");
                cur = (sumR + high[n-i-1]) % (bits + 1);
            } else {
                // System.out.println("b1");
                if (bits == 1) {
                    System.out.println("0");
                    continue;
                }
                cur = (sumL - low[n-i-1] + bits - 1) % (bits - 1);
            }

            int res = 1;
            while (cur != 0) {
                // System.out.println("cur:" + cur);
                cur = cur % Integer.bitCount(cur);
                res++;
            }
            System.out.println(res);

            /*
            char p = s[i];
            s[i] = s[i] == '1' ? '0' : '1';
            long x = Long.valueOf(String.valueOf(s), 2);
            List<String> l = new ArrayList<>();
            l.add("(" + x + "," + Long.bitCount(x) + ")");
            while (x != 0) {
                x %= Long.bitCount(x);
                l.add("(" + x + "," + Long.bitCount(x) + ")");
            }
            System.out.println(i + ": " + l);
            s[i] = p;
             */
        }
    }

    public void run() {
        if (__FILE_DEBUG_FLAG__ == __t__) {
            try {
                is = new FileInputStream(__DEBUG_FILE_NAME__);
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
            System.out.println("FILE_INPUT!");
        } else {
            is = System.in;
        }
        in = new FastScanner(is);
        out = new PrintWriter(System.out);

        solve();
    }

    public static void main(final String[] args) {
        new Main().run();
    }
}


class FastScanner {
    private InputStream stream;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;

    public FastScanner(InputStream stream) {
        this.stream = stream;
        // stream = new FileInputStream(new File("dec.in"));
    }

    int read() {
        if (numChars == -1)
            throw new InputMismatchException();
        if (curChar >= numChars) {
            curChar = 0;
            try {
                numChars = stream.read(buf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (numChars <= 0)
                return -1;
        }
        return buf[curChar++];
    }

    public boolean isSpaceChar(int c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public boolean isEndline(int c) {
        return c == '\n' || c == '\r' || c == -1;
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public int[] nextIntArray(int n) {
        int[] array = new int[n];
        for (int i = 0; i < n; i++)
            array[i] = nextInt();

        return array;
    }

    public int[][] nextIntMap(int n, int m) {
        int[][] map = new int[n][m];
        for (int i = 0; i < n; i++) {
            map[i] = nextIntArray(m);
        }
        return map;
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public long[] nextLongArray(int n) {
        long[] array = new long[n];
        for (int i = 0; i < n; i++)
            array[i] = nextLong();

        return array;
    }

    public long[][] nextLongMap(int n, int m) {
        long[][] map = new long[n][m];
        for (int i = 0; i < n; i++) {
            map[i] = nextLongArray(m);
        }
        return map;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public double[] nextDoubleArray(int n) {
        double[] array = new double[n];
        for (int i = 0; i < n; i++)
            array[i] = nextDouble();

        return array;
    }

    public double[][] nextDoubleMap(int n, int m) {
        double[][] map = new double[n][m];
        for (int i = 0; i < n; i++) {
            map[i] = nextDoubleArray(m);
        }
        return map;
    }

    public String next() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        StringBuilder res = new StringBuilder();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isSpaceChar(c));
        return res.toString();
    }

    public String[] nextStringArray(int n) {
        String[] array = new String[n];
        for (int i = 0; i < n; i++)
            array[i] = next();

        return array;
    }

    public String nextLine() {
        int c = read();
        while (isEndline(c))
            c = read();
        StringBuilder res = new StringBuilder();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isEndline(c));
        return res.toString();
    }

    public int[][] nextPackedIntArrays(int packN, int size) {
        int[][] res = new int[packN][size];
        for (int i = 0; i < size; i++) {
            for (int j = 0; j < packN; j++) {
                res[j][i] = nextInt();
            }
        }
        return res;
    }
}


Measured memory_bytes: 66812