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_prime(m):
    if m<=1:
        return False
    for i in range(2,int(math.sqrt(m))+1):
        if m%i==0:
            return False
    return True
def is_square(n):
    if math.sqrt(n)%1==0:
        return True
    else:
        return False
n=int(input())
nums=list(map(int,input().split()))
for num in nums:
    if not is_square(num):
        print("NO")
    else:
        root=math.sqrt(num)
        if is_prime(root):
            print("YES")
        else:
            print("NO")
