Problem:
Score : 400 points

Problem Statement

Let \mathrm{popcount}(n) be the number of 1s in the binary representation of n.
For example, \mathrm{popcount}(3) = 2, \mathrm{popcount}(7) = 3, and \mathrm{popcount}(0) = 0.

Let f(n) be the number of times the following operation will be done when we repeat it until n becomes 0: "replace n with the remainder when n is divided by \mathrm{popcount}(n)." (It can be proved that, under the constraints of this problem, n always becomes 0 after a finite number of operations.)

For example, when n=7, it becomes 0 after two operations, as follows:

\mathrm{popcount}(7)=3, so we divide 7 by 3 and replace it with the remainder, 1.

\mathrm{popcount}(1)=1, so we divide 1 by 1 and replace it with the remainder, 0.

You are given an integer X with N digits in binary.
For each integer i such that 1 \leq i \leq N, let X_i be what X becomes when the i-th bit from the top is inverted.
Find f(X_1), f(X_2), \ldots, f(X_N).

Constraints

1 \leq N \leq 2 \times 10^5

X is an integer with N digits in binary, possibly with leading zeros.

Input

Input is given from Standard Input in the following format:

N
X

Output

Print N lines. The i-th line should contain the value f(X_i).

Sample Input 1

3
011

Sample Output 1

2
1
1

X_1 = 7, which will change as follows: 7 \rightarrow 1 \rightarrow 0. Thus, f(7) = 2.

X_2 = 1, which will change as follows: 1 \rightarrow 0. Thus, f(1) = 1.

X_3 = 2, which will change as follows: 2 \rightarrow 0. Thus, f(2) = 1.

Sample Input 2

23
00110111001011011001110

Sample Output 2

2
1
2
2
1
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
1
3

Solution in C# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.Linq;
namespace AISing.Problems
{
    class D
    {
        static void Main()
        {
            int[] pc = new int[300000];
            for (int d = 0; d < pc.Length; d++)
            {
                int cnt = 0;
                int m = d;
                while (m != 0)
                {
                    if (m % 2 == 1) cnt++;
                    m /= 2;
                }
                pc[d] = cnt;
            }

            int n = int.Parse(Console.ReadLine());
            char[] cs = Console.ReadLine().ToCharArray();

            int pcX = cs.Count(c => c == '1');

            if (pcX == 1)
            {
                if (cs[n-1] == '1')
                {
                    for (int i = 0; i < n-1; i++)
                    {
                        Console.WriteLine(2);
                    }
                    Console.WriteLine(0);
                }
                else
                {
                    for (int i = 0; i < n-1; i++)
                    {
                        if (cs[i] == '1') Console.WriteLine(0);
                        else Console.WriteLine(1);
                    }
                    Console.WriteLine(2);
                }
            }
            else
            {
                int xModPcXp1 = 0;
                int xModPcXm1 = 0;
                foreach (var c in cs)
                {
                    xModPcXp1 = (xModPcXp1 * 2) % (pcX + 1);
                    xModPcXp1 = c == '1' ? (xModPcXp1 + 1) % (pcX + 1) : xModPcXp1;

                    xModPcXm1 = (xModPcXm1 * 2) % (pcX - 1);
                    xModPcXm1 = c == '1' ? (xModPcXm1 + 1) % (pcX - 1) : xModPcXm1;
                }
                int[] exp2ModPcXp1 = new int[n];
                int[] exp2ModPcXm1 = new int[n];
                exp2ModPcXp1[0] = 1 % (pcX + 1);
                exp2ModPcXm1[0] = 1 % (pcX - 1);
                for (int i = 1; i < n; i++)
                {
                    exp2ModPcXp1[i] = exp2ModPcXp1[i-1] * 2 % (pcX + 1);
                    exp2ModPcXm1[i] = exp2ModPcXm1[i-1] * 2 % (pcX - 1);
                }

                for (int i = 0; i < n; i++)
                {
                    int res = 1;
                    if (cs[i] == '0')
                    {
                        int y = (xModPcXp1 + exp2ModPcXp1[n-i-1]) % (pcX + 1) ;
                        while (y != 0)
                        {
                            res++;
                            y %= pc[y];
                        }
                    }
                    else
                    {
                        int y = (xModPcXm1 - exp2ModPcXm1[n-i-1]) % (pcX - 1);
                        y = (y + (pcX - 1)) % (pcX - 1);
                        while (y != 0)
                        {
                            res++;
                            y %= pc[y];
                        }
                    }
                    Console.WriteLine(res);
                }
            }
            Console.Out.Flush();
        }
    }
}