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.
num = int(input())
nums = list(map(int, input().split()))

square_roots = {}
results = []

for i in nums:
    if i in square_roots:
        results.append(square_roots[i])
    else:
        if i == 4 or (int(i**0.5))**2 == i:
            if i == 4:
                result = "YES"
            else:
                sq = int(i**0.5)
                k = int(i**0.25) + 1
                j = 2
                is_prime = True
                while j <= k:
                    if sq % j == 0:
                        is_prime = False
                        result = "NO"
                        break
                    j += 1
                if is_prime:
                    result = "YES"
            square_roots[i] = result
            results.append(result)
        else:
            result = "NO"
            square_roots[i] = result
            results.append(result)

print('\n'.join(results))