Let's define the complexity of the number as the number of its divisors. Find among the numbers from to the most complex number. If there are several such numbers, find the smallest of them.
First line contains the number of test cases (1 \le t \le 100). Each of the next lines contains one integer (1 \le n \le 10^{18}).
For each test case print in a separate line the most complex number from to and its complexity.
Example 1