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
def factor(n, c):
    f = lambda x: (x*x+c) % n
    t, h, d = 2, 2, 1
    while d == 1:
        t = f(t); h = f(f(h)); d = math.gcd(t-h, n)
    if d == n:
        return factor(n, c+1)
    return d
a = int(input())
b = list(map(int,input().split()))
for i in b:
    if i == 1 or i == 2 or i == 3:
        print('NO')
    elif i == 4:
        print('YES')
    elif math.sqrt(i).is_integer():
        c = set()
        for y in range(1,10):
            c.add(factor(i,y))
            if len(c) != 1:
                print('NO')
                break
        else:
            print('YES')
    else:
        print('NO')