IE3 - Non-Square Free Numbers
A positive integer k is called squarefree if k is not divisible by d2 for any d > 1
The input contains one integer t denoting the number of test cases. Each of the following t lines contain a single integer n, 1 ≤ n ≤ 1010
Your program should output one integer per test case, the n-th non-squarefree number.
Almost duplication of: http://www.spoj.com/problems/SQFREE/ moved to tutorial.