Maximum Multiple
说明
Given an integer n, Chiaki would like to find three positive integers x, y and z such that: n=x+y+z, x∣n, y∣n, z∣n and xyz is maximum.(若b可被a整除，或a整除b，则可记作a|b)输入格式
There are multiple test cases. The first line of input contains an integer T(1≤T≤106), indicating the number of test cases. For each test case:
The first line contains an integer n(1≤n≤106).
The first line contains an integer n(1≤n≤106).
输出格式
For each test case, output an integer denoting the maximum xyz. If there no such integers, output −1 instead.3
1
2
3-1
-1
1