B. 5ayef men el ba6 lek M3tazzz?
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Anatidaephobia is the fear that a duck may be watching you.

M3taz is afraid of ducks and has never been on a lake trip because of it.

However, his friends want to surprise him with a lake trip, but they need to find a lake with no ducks so that M3taz can join them. Help M3taz friends plan a surprise lake trip by determining which lakes are suitable for him to visit.

You are given the number of ducks in each lake. For each lake. If a lake has no ducks, it is suitable for M3taz to visit. Otherwise, it is not suitable for him to visit.

Determine whether it is suitable for M3taz to visit the lake or not.

Input

The first line of the input contains an integer $$$n$$$ $$$(1 \le n \le 10^4)$$$ — denotes the number of lakes.

For each lake you are given a single integer $$$x$$$ $$$(0 \le x \le 100)$$$ — denotes the number of ducks in the $$$i_{th}$$$ lake.

Output

Print $$$n$$$ lines, each line print "YES" if M3taz can go to that lake, print "NO" otherwise.

You can output the answer in any case. For example, the strings "yEs", "yes", and "YES" will also be recognized as positive responses.

Example
Input
3
2
0
77
Output
NO
YES
NO
Note