#10019Funny Encryption Method

★

時間限制：2000 毫秒記憶體限制：64 MB

A student from ITESM Campus Monterrey plays with a new encryption method for numbers. This method consists of the following steps:

This student failed Computational Organization, that's why this student asked the judges of ITESM Campus Monterrey's internal ACM programming contest to help find the number of 1-bits of these two representations so that he can continue playing.

You have to write a program that reads a number and gives as output the numbers and .

Input

The first line will contain a number which is the number of cases that you have to process. Each of the following lines () will contain the number (, in decimal representation) which is the number the student wants to encrypt.

Output

You will have to output lines, each containing the numbers and in that order, separated by one space, corresponding to that line's number to encrypt.

範例輸入 1

範例輸出 1

3 5
6 3
5 5

Pro 專屬功能：查看這題在歷屆 CPE 出現過幾次 — 升級以解鎖.

Step	Example

1. Read the number $N$ to encrypt	$M = 265$
2. Interpret $N$ as a decimal number	$X_1 = 265$ (decimal)
3. Convert the decimal interpretation of $N$ to its binary representation	$X_1 = 100001001$ (binary)
4. Let $b_1$ be equal to the number of 1's in this binary representation	$b_1 = 3$
5. Interpret $N$ as a hexadecimal number	$X_2 = 265$ (hexadecimal)
6. Convert the hexadecimal interpretation of $N$ to its binary representation	$X_2 = 1001100101$
7. Let $b_2$ be equal to the number of 1's in the last binary representation	$b_2 = 5$
8. The encryption is the result of $M \oplus (b_1 \times b_2)$	$265 \oplus (3 \times 5) = 262$

b_1

b_2

N

N

0 < N \le 1000

M

0 < M \le 9999

N

b_1

b_2

265⊕

(3×

5)=

262