Prime Number Checker

You are given a sequence of non-negative integers. Your task is to determine whether each integer is a prime number.

A prime number \( p \) is defined as a number greater than 1 that has no positive divisors other than 1 and \( p \) itself.

For each test case, output "YES" if the number is prime and "NO" otherwise.

inputFormat

The first line of input contains an integer \(T\) representing the number of test cases. Each of the following \(T\) lines contains one integer \(n\) where \(0 \leq n \leq 60\).

outputFormat

For each test case, output a single line with "YES" if the number is prime, otherwise output "NO".

## sample

3
1
2
7

NO
YES
YES

</p>