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.
t = int(input())
for i in range(t):
    n = int(input())
    if n <= 1:
        print("NO")
    elif n == 2 or n == 3:
        print("YES")
    elif n % 2 == 0:
        print("NO")
    else:
        is_prime = True
        for w in range(3, int(n**0.5) + 1, 2):
            if n % w == 0:
                is_prime = False
                break
        if is_prime:
            print("YES")
        else:
            print("NO")
