using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<long, long>;


class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        int N = cin.nextint;
        var dp = new int[N + 1];
        for (int i = 0; i <= N; i++)
        {
            int cnt = 0;
            long j = i;
            while (popcnt(j) != 0)
            {
                j %= popcnt(j);
                cnt++;
            }
            dp[i] = cnt;
            //WriteLine($"i:{i} popcnt(i):{popcnt(i)} times:{cnt}");      
        }
        //各ビットの寄与を求める
        var X = cin.next;
        var B = X.Count(i => i == '1');
        var v = B + 1;
        var s = B - 1;

        var Y = X.reverse();
        var pop = new pair[N];
        var down = new pair[N];

        long kv = 1;
        long ks = 1;


        long kvsum = 0;
        long kssum = 0;
        for (int i = 0; i < N; i++)
        {
            if (Y[i] == '1')
            {
                pop[i] = new pair(kv, ks);
                kvsum += kv;
                kssum += ks;
            }
            else
            {
                down[i] = new pair(kv, ks);
            }
            kv = kv * 2 % v;
            if (s > 0) ks = ks * 2 % s;
        }


        for (int i = N - 1; i >= 0; i--)
        {
            //sで割る
            if (Y[i] == '1')
            {
                var tmp = kssum - pop[i].s;
                if (s > 0)
                {
                    tmp %= s;
                    WriteLine(dp[tmp] + 1);
                }
                else
                {
                    WriteLine(0);
                }
            }
            //vで割る
            else
            {
                var tmp = kvsum + down[i].f;
                tmp %= v;
                WriteLine(dp[tmp] + 1);
            }
        }

    }
    long popcnt(long n)
    {
        long c = (n & 0x5555555555555555) + ((n >> 1) & 0x5555555555555555);
        c = (c & 0x3333333333333333) + ((c >> 2) & 0x3333333333333333);
        c = (c & 0x0f0f0f0f0f0f0f0f) + ((c >> 4) & 0x0f0f0f0f0f0f0f0f);
        c = (c & 0x00ff00ff00ff00ff) + ((c >> 8) & 0x00ff00ff00ff00ff);
        c = (c & 0x0000ffff0000ffff) + ((c >> 16) & 0x0000ffff0000ffff);
        c = (c & 0x00000000ffffffff) + ((c >> 32) & 0x00000000ffffffff);
        return c;
    }
}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}


Measured memory_bytes: 39452