Shahadat is a great programmer who loves sequences. All the time he thinks about sequences. He is so fond of sequences that sometimes he finds new sequences in his dreams.

One day he fell asleep and in his dream he found a new sequence, which is as follows:

    (2x1), (2x2 + 1), (2x3), (2x4 + 1) ... (2xn + 1)

Where, 1 <= x_i <= 30, n is even number and 2 <= n <= 10⁵.

For simplicity, you can think it as an array (A) of n integers. Where:

• A[1] = 2^x₁
• A[2] = 2^x₂ + 1
• A[3] = 2^x₃
• ...
• A[n] = 2^x_n + 1

You will be given the values of x₁, x₂ ... x_n.

You have to answer Q (1 <= Q <= 10⁵) queries. In each query you will be given two integers l and r (1 <= l <= r <= n). You have to answer whether the summation of all elements of array A from l to r (inclusive) is even or odd.

Input

In the first line you will be given an integer n. In the next line you will be given n integers which are the values of x₁, x₂ ... x_n. In the third line you will be given an integer Q. In the next Q lines you will be given two integers l and r.

Output

For each query print "Even" if (A[l] + a[l+1] + ... + A[r]) is even, otherwise print "Odd" without quotes.

Constraints

1 <= x_i <= 30

2 <= n <= 10⁵ and n is even.

1 <= Q <= 10⁵

1 <= l <= r <= n

For better understanding see the sample input output.

Example

Input:
5
3 2 1 2 2
3
1 3
2 5
2 3

Output:
Odd
Even
Odd