Cody was once understanding numbers, their squares and perfect squares from his teacher.
A perfect square is a number that can be expressed as square of an integer. To check how much Cody understood the concept his teacher kept a test. He has to find the nearest perfect square of the given number N.
The first line of input consists of a single integer T denoting the number of test cases.
The first line of each test case consists of single integer N.
For each test case print the nearest perfect square.