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.
# 李城岳 生命科学学院 2300012106
import math
a = input()
nums = list(map(int, input().split()))
for num in nums:
    judge = 0
    sqrt = math.sqrt(num)
    intt = int(sqrt//1)
    if sqrt - intt == 0.0:
        sqrtt = math.sqrt(intt)
        inttt = int(sqrtt//1)
        if sqrtt - inttt != 0.0:
            for i in range(2,inttt):
                if intt % i == 0:
                    print('NO')
                    judge = 1
                    break
            if judge == 0:
                print('YES')
        else:
            print('NO')
    else:
        print('NO')
