#K83747. Prime Number Checker
Prime Number Checker
Prime Number Checker
You are given a list of integers. For each integer, determine whether it is a prime number.
A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. Formally, a number \(n\) is prime if \(n > 1\) and its only divisors are 1 and \(n\).
inputFormat
The input begins with a single integer \(T\) on the first line, representing the number of test cases. The next line contains \(T\) space‐separated integers.
outputFormat
For each of the \(T\) integers, output a single line containing "YES" if the integer is a prime number, otherwise output "NO".
## sample4
2 4 5 1
YES
NO
YES
NO
</p>