### Kitty Number

Time Limit: 1000 ms
Memory Limit: 65536 KiB

#### Problem Description

A Kitty Number N is a positive integer satisfies that given two positive integers A and B, and among A, B and N, we have

N | ((A

Then

N | (A

Now, you are asked to judge a given positive number is Kitty Number or not.

^{2})*B+1)

Then

^{2}+B)

Now, you are asked to judge a given positive number is Kitty Number or not.

#### Input

The first line there is a number T (0 < T < 5000), denoting the test case number.

The following T lines for each line there is a positive number N (0 < N < 5000) you need to judge.

The following T lines for each line there is a positive number N (0 < N < 5000) you need to judge.

#### Output

For each case, output “YES” if the given number is Kitty Number, “NO” if it is not.

#### Sample Input

2 3 7

#### Sample Output

YES NO

#### Hint

X | Y means X is a factor of Y, for example 3 | 9; X

^{2}means X multiplies itself, for example 3^{2}= 9; X*Y means X multiplies Y, for example 3*3 = 9.#### Source

2009湖南大学校赛