CF230B T-primes

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

Print $ n $ lines: the $ i $ -th line should contain "YES" (without the quotes), if number $ x_{i} $ is Т-prime, and "NO" (without the quotes), if it isn't.

The given test has three numbers. The first number 4 has exactly three divisors — 1, 2 and 4, thus the answer for this number is "YES". The second number 5 has two divisors (1 and 5), and the third number 6 has four divisors (1, 2, 3, 6), hence the answer for them is "NO".