Odd Prime Factor Checker

Given a positive integer ( n ), decompose it into its prime factors: ( n = p_1 \times p_2 \times p_3 \times \dots \times p_x ), where each ( p_i ) is a prime number. A number ( n ) is called an Odd Prime Factor Number (or simply Odd Factor Only) if all of its prime factors are odd. Note that by convention, ( 1 ) (having no prime factors) is considered as an Odd Prime Factor Number.


You are given several test cases. For each case, determine if ( n ) is an Odd Prime Factor Number.

inputFormat

The first line contains an integer ( T ) representing the number of test cases. Each of the following ( T ) lines contains a single positive integer ( n ).

outputFormat

For each test case, output a single line containing Yes if ( n ) is an Odd Prime Factor Number and No otherwise.

sample

5
15
2
1
81
14

Yes
No
Yes
Yes
No