We know that prime numbers are positive integers that have exactly two distinct positive divisors. Similarly, we'll call a positive integer *t* Т-prime, if *t* has exactly three distinct positive divisors.

You are given an array of *n* positive integers. For each of them determine whether it is Т-prime or not.
The first line contains a single positive integer, *n* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>), showing how many numbers are in the array. The next line contains *n* space-separated integers *x*<sub class="lower-index">*i*</sub> (1 ≤ *x*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">12</sup>).

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is advised to use the cin, cout streams or the %I64d specifier.
from functools import lru_cache      
import math
lru_cache(maxsize=None)

n=int(input())
l=list(map(int,input().split()))
lst=[]
for num in l:
    s=math.sqrt(num)
    if s%1==0 and s!=1:
        lst.append(int(s))
    else:
        lst.append(0)
        
dp=[0]+[1]*(max(lst)-2)+[0]
for i in range((max(lst))//2):
    if dp[i]==1:
        for j in range(2*i+1,max(lst),i+1):
            dp[j]=0

for i in lst:
    if dp[i-1]==1:
        print("YES")
    elif i==2:
        print("YES")
    else:
        print("NO")