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.
#https://codeforces.com/problemset/problem/230/B

import math
import numpy as np

if __name__=="__main__":
    n = int(input())
    s = [int(x) for x in input().split(" ")]
    for x in s:
        t = 1
        for i in range(1,math.ceil(math.sqrt(x))+1):
            if (x%i)==0:
                t+=1
        if t==3:
            print("YES")
        else:
            print("NO")

