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.
from math import sqrt
def is_prime(n):
    if n == 2:
        return True
    else:
        for i in range(2, int(n ** 0.5) + 1):
            if n % i != 0:
                continue
            else:
                return False
        return True

   
n=int(input())
numbers=list(map(int,input().split()))

for number in numbers:
    if number == 4:
        print("YES")
        continue
    Lastdigit=str(number)[-1]
    if Lastdigit == "1" or Lastdigit == "5" or Lastdigit == "9":
        if sqrt(number)==int(sqrt(number)) and is_prime(int(sqrt(number))):
            print("YES")
        else:
            print("NO")
    else:
        print("NO")