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.
import math

n = int(input())
a = input().split()
for i in a:
    if math.sqrt(int(i)) % 1 == 0:
        if math.sqrt(int(i)) == 2:
            print('YES')
        elif math.sqrt(int(i)) % 2 == 0:
            print('NO')
        elif int(i) == 1:
            print('NO')
        elif math.sqrt(int(i))>3 and math.sqrt(int(i))%3==0:
            print('NO')
        elif math.sqrt(int(i)) > 5 and math.sqrt(int(i)) % 5== 0:
            print('NO')
        elif math.sqrt(int(i))>7 and math.sqrt(int(i))%7==0:
            print('NO')
        else:
            for j in range(2, int(math.sqrt(math.sqrt(int(i)))) + 1):
                if int(i) % j == 0:
                    print('NO')
                    break
            else:
                print('YES')
    else:
        print('NO')

