Given a natural number N, print 1 if it is perfect square else 0.
Input:
The first line of input contains an integer T denoting the number of test cases. For each test case there will be single line containing N, where N is the number to be checked whether perfect square or not.
Output:
1 if it is perfect square else 0
Constraints:
1 <= T <= 30
1 <= N <= 100000
Example:
Input:
3
100
10
125
Output:
1
0
0
blackshadows | 242 |
xmyqsh | 216 |
hanuman001 | 172 |
Adarsh Trivedi | 168 |
layman_brother | 168 |
blackshadows | 724 |
xmyqsh | 557 |
aman19 | 402 |
r0c2048 | 360 |
kspk | 331 |
akhayrutdinov | 5005 |
Ibrahim Nash | 4871 |
Quandray | 4338 |
sanjay05 | 3668 |
blackshadows | 3228 |