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.
n = int(input())
a = [pow(int(i),0.5) for i in input().split()]

a1 = [i for i in a if int(i) == i]
if a1 == []:
    for _ in range(n):
        print('NO')
else:
    m = max(a1)
    m1 = int(pow(m,0.5))
    p = [0]*(m1+1)
    pp = []
    for i in range(2,m1+1):
        if p[i] == 0:
            j=2
            while i*j <= m:
                p[i*j] = 1
                j+=1
            pp.append(i)


    for i in range(n):
        if a[i] == 1:
            print('NO')
        elif a[i] <= m1:
            if a[i] in pp:
                print('YES')
        elif a[i] in a1:
            k = True
            for j in pp:
                if a[i]%j == 0:
                    k = False
                    break
            if k:
                print('YES')
            else:
                print('NO')
        else:
            print('NO')