Chef solved so many hard questions, now he wants to solve some easy problems for refreshment. Chef asks Cheffina for the new question. Cheffina challenges the chef to print the total number of 0's in the binary representation of N(natural number).

-----Input:-----
- First-line will contain $T$, the number of test cases. Then the test cases follow. 
- Each test case contains a single line of input, $N$. 

-----Output:-----
For each test case, output in a single line answer.

-----Constraints-----
- $1 \leq T \leq 10^6$
- $1 \leq N \leq 10^6$

-----Sample Input:-----
2
2
4

-----Sample Output:-----
1
2

-----EXPLANATION:-----
For 1) Binary representation of 2 is 10. i.e. only one 0 present in it.
For 2) Binary representation of 4 is 100, i.e. two 0's present in it.

Difficulty: UNKNOWN_DIFFICULTY

Solutions:
from sys import stdin, stdout
input = stdin.readline
from collections import defaultdict as dd
import math

def geti():
	return list(map(int, input().strip().split()))

def getl():
	return list(map(int, input().strip().split()))

def gets():
	return input()

def geta():
	return int(input())

def print_s(s):
	stdout.write(s + '\n')

def solve():
	for _ in range(geta()):
		n = geta()
		n = bin(n).split('b')[1]
		print(n.count('0'))

def __starting_point():
	solve()
__starting_point()


from sys import stdin
n = int(stdin.readline())
for _ in range(n):
	n1 = int(stdin.readline())
	b = bin(n1)[2:]
	print(b.count('0'))