Given an integer $L$
, you have to find the product of two different integers such that their LCM (Least Common Multiple) is $L$
and the product is maximum possible.
The first line contains an integer $T$
($1 \leq T \leq 1000$
), the number of test cases.
The next $T$
lines contain an integer $L$
($2 \leq L \leq 10^{12}$
), LCM of two different integers.
For each test case, print the maximum possible product of those two integers. As the result can
be very big, print the result modulo $1000000007$
.
Input | Output |
---|---|
3 5 13 27 | 5 13 243 |
For the first test case, let two integers For the second test case, let two integers For the third test case, let two intergers |