Rupsa and Magical Prime

0

0 votes
Easy-Medium, Easy-Medium
Problem

Alex and Stella were siblings and used to play games in free time. Alex cheated in a game and stella got upset with him. Since stella loves playing with numbers . Alex wants to make her happy but she will be happy only when she will get a magical prime number.

A magical prime number is one which has a perfect square number of primitive roots.

‌The definition of primitive root can be found here: Primitive Root

Alex offers Stella different numbers to play. We need to know which numbers will make Stella happy.

Input

The first line of the input contains an integer T denoting the number of the test cases. Each test case contains a single prime integer denoting P.

Output

Print "Yes" (without quotes) if Number of primitive roots is perfect square otherwise "No"(without quotes).

Constraints

1 <= T <=10

2 <= P <= 109

Sample Input
2
7 
11
Sample Output
No
Yes
Time Limit: 1
Memory Limit: 256
Source Limit:
Explanation

case 1: 7 had only two primitive roots 3 and 5 and 2 is not a perfect square. Hence, answer is No. case 2: 11 had 4 primitive roots. Hence the answer is Yes.

Editor Image

?