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 sys import stdin,stdout
#input = stdin.readline

def main():
    #t = int(input())
    t = 1
    def isPrime(num):
        for i in range(2,min(num,int(num**0.5)+2)):
            if num%i==0:
                return 0
        return 1
    for z in range(t):
        n = int(input())
        #a,b,c = map(int,input().split())
        ai = list(map(int,input().split()))
        for i in ai:
            if int(i **0.5)**2 == i and isPrime(int(i **0.5)):
                print("YES")
            else:
                print("NO")
main()

