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# (Mono-mcs 6.8.0.105) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
class d{
    public static void Main(){
        int n = int.Parse(Console.ReadLine());
        string str = Console.ReadLine();
        int popcount = str.Count(c => c=='1');
        int plus = Mod(str, popcount+1);
        int minus = Mod(str, popcount-1);
        int[] dpPlus = new int[n+1];
        int[] dpMinus = new int[n+1];
        dpPlus[1] = 1;
        dpMinus[1] = 1;
        for(int i=2; i<=n; i++){
            dpPlus[i] = (dpPlus[i-1]*2)%(popcount+1);
        }
        for(int i=2; i<=n; i++){
            dpMinus[i] = (dpMinus[i-1]*2)%(popcount-1);
        }
        for(int i=0; i<n; i++){
            int ans = 1;
            if(popcount == 1 && str[i] == 1){
                Console.WriteLine(0);
                continue;
            }
            var strings = Enumerable.Repeat('0',n).ToArray();
            strings[i] = '1';
            //int mod = str[i] == '1' ? Mod(new String(strings), popcount-1) : Mod(new String(strings), popcount+1);
            //int numT = str[i] == '0' ? (mod + plus)%(popcount+1) : (mod - minus)%(popcount-1);
            int num = str[i] == '0' ? (dpPlus[n-i] + plus)%(popcount+1) : (dpMinus[n-i] - minus)%(popcount-1);
            while(num != 0){
                int bits = Convert.ToString(num,2).Count(c => c=='1');
                num %= bits;
                ans++;
                //Console.WriteLine("num: {0}",num);
            }
            Console.WriteLine(ans);
        }
    }
    public static int Mod(string str, int n){
        int ret = 0;
        for(int i=0; i<str.Length; i++){
            ret = ret*2 + (str[i]-'0');
            if(ret >= n){
                ret -= n;
            }
        }
        return ret;
    }
}