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.
n=input()
n1=input().split()
for i in range(len(n1)):
  L=[]
  c=1
  while c<=10:
     if int(n1[i])%c==0:
      if int(n1[i])//c not in L:
        L.append(int(n1[i])//c)
      if c not in L:
        L.append(c)
      c+=1
     else:
       c+=1
  if len(L)>3 or len(L)<3 :
    print("NO")
  else:
    print("YES")