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

def get_primes(n):
    primes = []
    for i in range(2, n+1):
        if is_prime(i):
            primes.append(i)
    return primes

def can_be_divided(n, primes):
    if n == 1:
        return True
    else:
        for p in primes:
            if p >= int(n**0.5):
                break
            if n % p == 0:
                return True
            else:
                return False

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

primes = get_primes(int(1e6))

for i in a:
    if i==2 or i==3:
        print("NO")
    elif i==4:
        print("YES")
    elif can_be_divided(i, primes):
        print("NO")
    elif int(i**0.5)**2 == i:
        print("YES")
    else:
        print("NO")