SP12295 INVPHI - Smallest Inverse Euler Totient Function

This task is the inverse of [ETF](../ETF/ "ETF") problem, given an integer **n** find smallest integer **i** such that φ(**i**)=**n**, where φ denotes [Euler's totient function](http://en.wikipedia.org/wiki/Euler's_totient_function "Euler's_totient_function").

The first line is an integer **T**(1 T For each test case, there is an integer **n**(1 n

For each test case, output Smallest Inverse Euler's Totient Function of **n**. if **n** doesn't have inverse, output -1.