EOJ-自适应编程学习平台

As we all kown,in computer’s world,the language is represented by ‘0’s and 1’s.The problem is coming,partychen want to know how many ‘0’s and ‘1’in a number based on binary if he give you a number based on decimal.

The first line of input gives the number of cases, $N(1 \leqslant N \leqslant 100)$. $N$ test cases follow.

The next $N$ lines will each contain a integers $M(1 \leqslant M \leqslant 10000000)$ based on decimal, as described above.

For each test case, output two numbers in one line separately represent the sum of ‘0’s and ‘1’s.

Hint:

If give you a 10 base on decimal,you get 1010 base on binary,and there are two ‘0’s and two ‘1’s.So you must output 2 2.