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 primer(m: int):
    primes = [2]
    for i in range(3, m + 1, 2):
        prime = True
        for j in primes:
            if i % j == 0:
                prime = False
                break
        if prime:
            primes.append(i)
    return primes


def main():
    input()
    list_of_numbers = tuple(map(lambda x: int(sqrt(int(x))) if sqrt(int(x)).is_integer() else 1, input().split()))
    max_val = max(list_of_numbers)
    primes = primer(max_val)
    for i in list_of_numbers:
        if i == 1:
            print("NO")
        else:
            if i in primes:
                print("YES")
            else:
                print("NO")


if __name__ == '__main__':
    main()