Zju -- Simple Task

Original question:

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

 

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.

 

Output

 

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

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

 

Sample Input

1

24

 

Sample Output

3 3

 

Original code:

[Cpp]
# Include <stdio. h>
 
# Include <math. h>
 
Int main ()
 
{
 
Int N;
 
Int cases;
 
Int I, j;
 
Int flag;
 
Scanf ("% d", & cases );
 
While (cases --)
 
{
 
Scanf ("% d", & N );
 
Flag = 0;
 
For (I = 1; I + = 2)
 
{
 
For (j = 0; j ++)
 
{
 
If (I * pow (2, j)> N)
 
Break;
 
If (I * pow (2, j) = N)
 
{
 
Printf ("% d \ n", I, j );
 
Flag = 1;
 
Break;
 
}
 
}
 
If (flag = 1)
 
Break;
 
}
 
}
 
Return 0;
 
}