问题2010--A Simple Task

2010: A Simple Task

[命题人 : ]
时间限制 : 1.000 sec  内存限制 : 64 MB

题目描述

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.

输入

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.

输出

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.

样例输入 Copy

1
24

样例输出 Copy

3 3

来源/分类