Monk introduces the concept of palindrome saying,"A palindrome is a sequence of characters which reads the same backward or forward."
Now, since he loves things to be binary, he asks you to find whether the given string is palindrome or not. If a given string is palindrome, you need to state that it is even palindrome (palindrome with even length) or odd palindrome (palindrome with odd length).
The first line consists of $$T$$, denoting the number of test cases.
Next follow $$T$$ lines, each line consisting of a string of lowercase English alphabets.
For each string , you need to find whether it is palindrome or not.
If it is not a palindrome, print NO.
If it is a palindrome, print YES followed by a space; then print EVEN it is an even palindrome else print ODD.
Output for each string should be in a separate line.
See the sample output for clarification.
$$1 \le T \le 50$$
$$1 \le length \space of \space string \le 10^5$$
The first string is not a palindrome.
The second and third strings are palindromes of even and odd lengths respectively.