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.
#游敬恩，2300012555
import math

def pd_candidate(n):
    s = math.ceil(math.sqrt(n))
    primes = [True]*(s)
    primes[0] = primes[1] = False
    d = []
    for i in range(2, s):
        if primes[i]:
            d.append(i)
            for j in range(i ** 2, s, i):
                primes[j] = False
    return d

def determine(x):
    primes = pd_candidate(x)
    ind = 0
    for i in primes:
        if x%(int(i)) == 0:
            ind = 1
            break
        else:
            pass
    if ind == 0:
        return True
    else:
        return False

n = int(input())
d = dict(zip([i for i in range(n)], map(int, input().split())))
for i in range(n):
    if d[i] == 1:
        print("NO")
    else:
        s = math.sqrt(d[i])
        if int(s) == s:
            if determine(s):
                print("YES")
            else:
                print("NO")
        else:
            print("NO")