 Help Nobita
##### Submissions: 2205   Accuracy: 28.65%   Difficulty: Easy   Marks: 2

Nobita has his exam on the way. Nobita is trying really hard to clear the examinations this time. So, he is practicing quite often. One day while practicing he faces a problem. The problem is as follows: Given a string S of lowercase characters, find out whether the summation of 'X' and 'Y' is even or odd, where X is the count of characters which occupy even positions in english alphabets and have even frequency, and Y is the count of characters which occupy odd positions in english alphabets and have odd frequency. Help Nobita to solve this problem.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first and only line of each testcase contains S.

Output:
For each test case, in a new line, print "EVEN" if X+Y is even, else print "ODD" without quotes.

Constraints:
1 <= T <= 100
1 <= |S| <= 1000

Example:
Input:
2
abbbcc
nobitaa

Output:
ODD
EVEN

Explanation:
Testcase1: X=0 and Y=1 so (X+ Y) = ODD.
'a' occupies 1st place(odd) in english alphabets and its frequency is odd(1), 'b' occupies 2nd position(even) but its frequency is odd(3) so it doesn't get counted , 'c' occupies 3rd position but its frequency is 2(even) so it also does't get counted.

Testcase2: X=0 and Y=2 so (X+ Y)= EVEN.
'n' occupies 14th position(even) in english alphabets but its frequency is odd(1) so it doesn't get counted. 'o' occupies 15th position and its frequency is odd(1). 'b' occurs at 2nd position(even) but its frequency is odd(1), 'i' occurs at 9th position(odd) and its frequency is also odd(1) and so on.

#### ** For More Input/Output Examples Use 'Expected Output' option **

Contributor: vaibhav garg
Author: justrelax

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.