Given integer N, you need to find four integers A,B,C,D, such that they're all factors of N (A|N,B|N,C|N,D|N), and N=A+B+C+D. Your goal is to maximize A×B×C×D.
First line contains an integer T(1≤T≤4⋅104), represents the number of test cases.
Each of the next T lines contains an integer N (1≤N≤4⋅104, N4 will not exceed 64 bit integer).
T lines, each line contains the answer (A×B×C×D) to correspond test case. If there is no way to find such four numbers, output −1.
A=B=C=D=2