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.
res = [0 for x in range(100000)]
prime = set()
pri = []
iii = 2
cnt = 0
for i in range(2,10000):
    if res[i] != 1:
        pri.append(i)
        cnt += 1
        prime.add(i**i)

    for iii in range(0,cnt+1):
        res[i*pri[iii]] = 1
        if i%pri[iii] == 0 or pri[iii]*i>10000:
            break
        
a = input()
arr = list(map(int,input().split()))
for h in arr:
    if h in prime:
        print("YES")
    else:
        print("NO")
