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.
n = int(input())
shuru = input()
liebiao0 = shuru.split()
liebiao = []
ans = []
for i in range(n):
    a = int(liebiao0[i])
    liebiao.append(a)
for i in range(n):
    x = int(liebiao[i])
    if x ** 0.5 != int(x ** 0.5):
        ans.append("NO")
    else:
        y = x ** 0.5
        z = int(y ** 0.5)
        check = 0
        for i in range(2 , z + 1):
            if y % i == 0:
                check = 1
        if check == 1:
            ans.append("NO")
        else:
            ans.append("YES")
for i in range(n):
    print(ans[i])
