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 is_prime(x):
    if x==2:
        return True
    elif x==1:
        return False
    else:
        flag=1
        for j in range(2,int(x**0.5)+1):
            if x%j==0:
                flag=0
                break
        if flag==1:
            return True
        else:
            return False

def square(x):
    if (int(x**0.5))**2==x:
        return True
    else:
        return False

n=int(input())
a=[int(i) for i in input().split()]

for k in a:
    if square(k):
        if is_prime(int(k**0.5)):
            print('YES')
        else:
            print("NO")
    else:
        print("NO")