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.
def result(n):
    i=2
    fac=[]
    while n>=2 and len(fac) <=3:
        if n%i==0:
            fac.append(i)
            n//=i
        else:
            i+=1
    if (len(fac) ==2) and (fac[0] == fac[-1]):
        print('YES')
    else:
        print('NO')
c=int(input())
p_ints=list(map(int,input().split()))
for n in p_ints:
    try:
        result(n)
    except IndexError:
        print('NO')