### A Simple Task

Time Limit: 1000 ms
Memory Limit: 65536 KiB

#### Problem Description

Given a positive integer n and the odd integer o and the nonnegative integer p such that n = o2^p.

For n = 24, o = 3 and p = 3.

Write a program which for each data set:

reads a positive integer n,

computes the odd integer o and the nonnegative integer p such that n = o2^p,

writes the result.

**Example**

For n = 24, o = 3 and p = 3.

**Task**

Write a program which for each data set:

reads a positive integer n,

computes the odd integer o and the nonnegative integer p such that n = o2^p,

writes the result.

#### Input

The first line of the input contains exactly one positive integer d equal to the number of data sets, 1 <= d <= 10. The data sets follow.

Each data set consists of exactly one line containing exactly one integer n, 1 <= n <= 10^6.

Each data set consists of exactly one line containing exactly one integer n, 1 <= n <= 10^6.

#### Output

The output should consists of exactly d lines, one line for each data set.

Line i, 1 <= i <= d, corresponds to the i-th input and should contain two integers o and p separated by a single space such that n = o2^p.

Line i, 1 <= i <= d, corresponds to the i-th input and should contain two integers o and p separated by a single space such that n = o2^p.

#### Sample Input

1 24

#### Sample Output

3 3

#### Hint

zoj1382
有链接提示的题目请先去链接处提交程序，AC后提交到SDUTOJ中，以便查询存档。

#### Source

面向对数据结构和算法不太懂的同学