|All-time Popular Problems|
|Transform to Sum Tree|
|Delete N nodes after M nodes of a linked list|
|The Celebrity Problem|
|Consecutive 1's not allowed|
|Pairwise swap elements of a linked list by swapping data|
|Boundary Traversal of binary tree|
|n'th node from end of linked list|
|Longest Common Subsequence|
Given a positive integer N, print count of set bits in it. For example, if the given number is 6, output should be 2 as there are two set bits in it.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The next T lines will contain an integer N.
Corresponding to each test case, in a new line, print count of set bits in it.
1 ≤ T ≤ 100
1 ≤ N ≤ 1000000