


Given 'ARR' = [1, 10, 5, 2, 8, 1 ] , answer is "ODD".
Here the maximum difference is between 10 and 1, 10 - 1 = 9
The first line of input contains an integer T’ denoting the number of test cases to run. Then the test case follows.
The first line of each test case contains ‘N’, the length of the array 'ARR'.
The second line of each test case contains ‘N’ space-separated elements of 'ARR'.
For each test case, print a single line containing “ODD” without quotes if the maximum difference is odd else print “EVEN” without quotes.
The output for each test case is printed in a separate line.
You don’t need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 100
1 <= N <= 5000
1 <= ARR[i] <= 10 ^ 9
where ‘N’ is the length of the array 'ARR', and 'ARR[i]' is an element of the 'ARR' respectively.
Time limit: 1 sec.
We will iterate over ARR and find the MAX and MIN of the ARR. And if the MAX - MIN is odd the return “ODD” else return "EVEN".
The algorithm will be-