J. Ahmad and Prediction Syndrome
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

We were discussing the number of teams that would qualify for the on-site contest, but we have not made a decision yet.

Although the number isn't known, Ahmad is sure that any team that robs at least $$$8$$$ distinct balloons will qualify.

Given that some team robbed $$$n$$$ distinct balloons, will they qualify?

Input

The first line contains an integer $$$t$$$ $$$(1 \leq t \leq 10)$$$ – the number of test cases.

The next $$$t$$$ lines each contain an integer $$$n$$$ $$$(1 \leq n \leq 10)$$$ – the number of balloons robbed.

Output

For each test case, $$$t$$$ print "YES" if the team will qualify; otherwise, print "NO". You can print "YES" or "NO" in any case, e.g., "YeS", "No" will be accepted.

Example
Input
4
5
7
2
8
Output
NO
NO
NO
YES