KIMODIV - Kimo and Divisors

no tags 

Kimo loves all sorts of properties of odd numbers. He learned a new algorithm to get all divisors of a certain number.

Help him to determine if a number has odd number of divisors.

Input

t - the number of test cases, then t test cases follows. [t <= 1000]

Each line contains one interger: N [1 <= N <= 109]

Output

For each test case output one line contains "YES" if the given number has odd number of divisors an "NO" otherwise.

Example

Input:
2
4
Output:
YES
NO

Note

in the 1st case: divisors of 4 are : (1, 2, 4) and the number of divisors is 3 (odd)
in the 2nd case: divisors of 7 are : (1, 7) and the number of divisors is 2 (even)

hide comments
nikhil_nihal: 2014-01-25 13:12:12

i m totally agree with @KANISH_THE_VISTA

Kanish_The_Vista: 2014-01-25 13:10:01

i think this question is ok for classical problem section

Mitch Schwartz: 2014-01-23 21:08:01

Ok, moved to tutorial.

P_Quantum: 2014-01-23 21:04:32

Easy..!!

Jacob Plachta: 2014-01-23 20:52:29

I agree, this should probably be a tutorial problem.

abhi: 2014-01-23 19:47:05

thanxx 2 m17

RIVU DAS: 2014-01-23 19:44:11

Last edit: 2014-01-24 15:20:18
Lakshay Singhal: 2014-01-23 19:31:51

very easy...for tutorial...


Added by:eagle93
Date:2014-01-23
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64