Alice's Winning Strategy

Alice is playing a game where her victory is determined by the length of a given string. For each test case, you are given a string s. Alice can guarantee a win if and only if the length of the string, \(|s|\), is odd (i.e. \(|s| \equiv 1 \pmod{2}\)). Otherwise, she loses.

Your task is to read an integer \(T\) (the number of test cases), followed by \(T\) non-empty strings, and for each string output "YES" if Alice wins and "NO" otherwise.

inputFormat

The input is given via standard input and consists of:

• The first line contains an integer \(T\) (\(1 \le T \le 10^5\)) — the number of test cases.
• Each of the following \(T\) lines contains a non-empty string \(s\).

outputFormat

For each test case, print a single line containing "YES" if the length of the string is odd, or "NO" if it is even.

## sample

3
abc
abcd
a

YES
NO
YES

</p>