A Simple Task

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 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.

Sample Input

1
24

Sample Output

3 3

#include"cstdio"
#include"iostream"
#include"cstring"
#include"cmath"
#include"algorithm"
using namespace std;
#define Max 1000000
int oo[Max+10],pp[Max+10];
void zx()
{
	for(int i = 1 ; i <= Max ; i ++)
	{
		int o = i, p = 0;
		while(o % 2 != 1)
		{
			o = o / 2;
			p += 1;
		}
		oo[i] = o;
		pp[i] = p;	
	}
}
int main()
{
	int n , d;
	zx();
	while(cin>>d)
	{
		for(int i = 0 ; i < d ; i ++)
		{
			cin>>n;
			cout<<oo[n]<<" "<<pp[n]<<endl;
		}
	}
	return 0;
}