B"You are given a number in binary representation consisting of exactly n bits, possibly, with leading zeroes. For example, for n = 5 the number 6 will be given as 00110 , and for n = 4 the number 9 will be given as 1001 . Let's fix some integer i such that 1 <= i <= n . In one operation you can swap any two adjacent bits in the binary representation. Your goal is to find the smallest number of operations you are required to perform to make the number divisible by 2^i , or say that it is impossible. Please note that for each 1 <= i <= n you are solving the problem independently. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^4 ). The description of the test cases follows. The first line of each test case contains one integer n ( 1 <= n <= 10^5 ) -- the length of the binary representation of the number. The second line of each test case contains a string of length n , consisting of 0 and 1 , -- the binary representation of the number. It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case, for each 1 <= i <= n output the smallest number of operations required to make the number divisible by 2^i , or output -1 if it is impossible. In the first test case, we cannot swap any elements, and the number 1 is not divisible by 2 . In the second test case, the initial number is 1 . It is not divisible by 2 , but if we perform the operation, then we obtain the number with binary representation 10 , which is equal to 2 in decimal representation, thus, it is divisible by 2 . But this number is not divisible by 4 and we cannot obtain any other number using the operations. In the third test case, the initial number is 2 . For i = 1 we do not have to perform any operations sinc"...