Desciption :
You are given a positive integer number n. Now you have to figure out the minimum number x such that n*x become a perfect square number. You will encounter several testcases t times.

Constraints :
1<=t<=1000
1<=n<=10000