Perfect Square

Time Limit: 0.5 sec

 

The Problem

A number n is called Perfect Square number if there exists an integer x such that x² = n.

For example: 4, 36, 49 are perfect square number, where 55, 43 are not.

You are given an integer n. You have to tell if it is a Perfect Square number or not.

 

The Input

Input starts with an integer T (1 ≤ T ≤ 20), denoting the number of test cases. Each case contains a single integer n (1 ≤ n ≤ 10¹⁸).

 

The Output

For each case, just print YES if it is a Perfect Square number, else print NO.

 

Sample Input

3

4

25

95

 

Sample Output

YES

YES

NO

 

 

Note:

In case 1, 2² = 4, so it is a Perfect Square number.

In case 3, there is no integer x such that x² = 95. So it is not a Perfect Square number.

 

 

Problem Setter: Sheikh Monir [Bangabandhu Sheikh Mujibur Rahman Science and Technology University]