Buggy python submission (verdict: Runtime Error):
def dfs(n):
    if n == 0:return 0
    return dfs(n % format(n, "b").count("1")) + 1
n = int(input())
x = input()
c = x.count("1")
a = int(x, 2)
j, k = a % (c + 1), a % (c - 1)
if c == 1:
    for i in range(n):
        if x[i] == "1":
            print(0)
        elif i == n - 1:
            print(2)
        else:
            print(1)
else:
    for i in range(n):
        if x[i] == "1":print(dfs((k - pow(2, n - i - 1, c - 1)) % (c - 1)) + 1)
        else:print(dfs((j + pow(2, n - i - 1, c + 1)) % (c + 1)) + 1)

Fixed submission:
def dfs(n):
    if n == 0:return 0
    return dfs(n % format(n, "b").count("1")) + 1
n = int(input())
x = input()
c = x.count("1")
a = int(x, 2)
if c == 1:
    for i in range(n):
        if x[i] == "1":
            print(0)
        elif i == n - 1:
            print(2)
        else:
            print(1)
else:
    j, k = a % (c + 1), a % (c - 1)
    for i in range(n):
        if x[i] == "1":print(dfs((k - pow(2, n - i - 1, c - 1)) % (c - 1)) + 1)
        else:print(dfs((j + pow(2, n - i - 1, c + 1)) % (c + 1)) + 1)

Buggy python submission (verdict: Runtime Error):
import sys
sys.setrecursionlimit(10**6)
def d(n):
 if n==0:return 0
 return d(n%bin(n).count("1"))+1
n=int(input())
x=input()
c=x.count("1")
a=int(x,2)
j,k=a%(c+1),a%(c-1)
for i in range(n):
 if x[i]=="1":print(d((k-pow(2,n-i-1,c-1))%(c-1))+1)
 else:print(d((j+pow(2,n-i-1,c+1))%(c+1))+1)

Fixed submission:
def dfs(n):
    if n == 0:return 0
    return dfs(n % format(n, "b").count("1")) + 1
n = int(input())
x = input()
c = x.count("1")
a = int(x, 2)
if c == 1:
    for i in range(n):
        if x[i] == "1":
            print(0)
        elif i == n - 1:
            print(2)
        else:
            print(1)
else:
    j, k = a % (c + 1), a % (c - 1)
    for i in range(n):
        if x[i] == "1":print(dfs((k - pow(2, n - i - 1, c - 1)) % (c - 1)) + 1)
        else:print(dfs((j + pow(2, n - i - 1, c + 1)) % (c + 1)) + 1)

Buggy python submission (verdict: Runtime Error):
def d(n):
 if n==0:return 0
 return d(n%bin(n).count("1"))+1
n=int(input())
x=input()
c=x.count("1")
a=int(x,2)
j,k=a%(c+1),a%(c-1)
for i in range(n):
 if x[i]=="1":print(d(k-pow(2,n-i-1,c-1)%(c-1))+1)
 else:print(d(j+pow(2,n-i-1,c+1)%(c+1))+1)

Fixed submission:
def dfs(n):
    if n == 0:return 0
    return dfs(n % format(n, "b").count("1")) + 1
n = int(input())
x = input()
c = x.count("1")
a = int(x, 2)
if c == 1:
    for i in range(n):
        if x[i] == "1":
            print(0)
        elif i == n - 1:
            print(2)
        else:
            print(1)
else:
    j, k = a % (c + 1), a % (c - 1)
    for i in range(n):
        if x[i] == "1":print(dfs((k - pow(2, n - i - 1, c - 1)) % (c - 1)) + 1)
        else:print(dfs((j + pow(2, n - i - 1, c + 1)) % (c + 1)) + 1)

Buggy python submission (verdict: Runtime Error):
def dfs(n):
    s = str(format(n, "b"))
    c = s.count("1")
    return l[n % c] + 1
n = int(input())
x = input()
xi = int(x, 2)
c = x.count("1")
l = [0]
for i in range(1, 2 ** n):
    l.append(dfs(i))
for i in range(n):
    k = 0
    if x[i] == "1":
        m = xi - pow(2, n - i - 1)
        c2 = c - 1
    else:
        m = xi + pow(2, n - i - 1)
        c2 = c + 1
    print(dfs(m))

Fixed submission:
def dfs(n):
    if n == 0:return 0
    return dfs(n % format(n, "b").count("1")) + 1
n = int(input())
x = input()
c = x.count("1")
a = int(x, 2)
if c == 1:
    for i in range(n):
        if x[i] == "1":
            print(0)
        elif i == n - 1:
            print(2)
        else:
            print(1)
else:
    j, k = a % (c + 1), a % (c - 1)
    for i in range(n):
        if x[i] == "1":print(dfs((k - pow(2, n - i - 1, c - 1)) % (c - 1)) + 1)
        else:print(dfs((j + pow(2, n - i - 1, c + 1)) % (c + 1)) + 1)