A. Round 1
time limit per test
1 second
memory limit per test
256 megabytes
input
Round1.in
output
standard output

"Guys!!! Omda is coming in 5 minutes" said the battle's organizer. Till then let us tell you some things about this contest:

  • First, This contest has only one setter who came up with all the problems.
  • Second, This contest's theme is Nesr El Scene.
  • Third, If you don't enjoy this contest we hope you at least enjoy the jokes.
  • The fourth was scored by Origi.
  • fifth fifth fifth fifth fifth.
  • The answer to this problem is "Yes" if there exists a string consisting of lowercase English letters of size $$$N$$$ (input) with no palindromic subsequences of size $$$2$$$ or more otherwise, the answer is "No".

A subsequence is a sequence that can be derived from the given sequence by deleting zero or more elements without changing the order of the remaining elements.

Input

The first line contains the number of test cases $$$T$$$ $$$(1 \leq T \leq 10^5)$$$.

The first line of each test case contains one integer $$$N$$$ $$$(1 \leq N \leq 10^9)$$$.

Output

For each test case, print "Yes" (without quotes and case insensitive) if there is a solution for the problem and "No" otherwise.

Example
Input
3
2
420
42
Output
Yes
No
No