A conveyor holds n crates whose labels are a permutation of 1..n. The only allowed operation is swapping two crates that are currently adjacent. The number of adjacent swaps needed to sort the crates into 1, 2, ..., n can vary, but its parity (even or odd) is fixed and equals the parity of the number of out-of-order pairs.
Report EVEN if the crates can be sorted using an even number of adjacent swaps, or ODD otherwise. The input is guaranteed to be a permutation of 1..n.
Input format
Line 1: an integer n, the number of crates.
Line 2: n space-separated integers, a permutation of 1..n.
Output format
A single line: EVEN or ODD.
Constraints
- 1 <= n <= 100000
- The second line is a permutation of the integers 1 through n.