Watering Plants Challenge

Tom has a very important task: watering his plants before sunset. Each plant requires exactly \(10\) minutes to be watered. Given the number of minutes remaining before sunset, determine whether Tom has enough time to water at least one plant. In other words, if he has strictly more than \(10\) minutes, he can water a plant; otherwise, he cannot.

For example, if Tom has 15 minutes left, he can water a plant, but if he has exactly 10 minutes or less, he cannot. Your job is to process multiple test cases.

inputFormat

The first line of input contains a single integer \(T\) (\(T \geq 1\)), the number of test cases. Each of the following \(T\) lines contains a single integer representing the number of minutes remaining before sunset.

Input is read from standard input (stdin).

outputFormat

For each test case, output a single line containing either YES if Tom can water at least one plant or NO otherwise. Output should be written to standard output (stdout).

## sample

3
15
30
25

YES
YES
YES

</p>