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.
import math
def is_perfect(x):
    sqrt=math.sqrt(x)
    if sqrt.is_integer():
        return True
    else:
        return False
def is_T_primes(x):
    set_1=set()
    if not is_perfect(x):
        return False
    else:
        for i in range(1,int(x**(1/2)+1)):
            if x%i ==0:
                set_1.add(i)
        if len(set_1)==2:
            return True
        else:
            return False

n=int(input())
list_1=list(map(int,input().split()))
for i in list_1:
        print("YES" if is_T_primes(i) else "NO")

