We all know Gru loves Agnes very much. One day Agnes asked Gru to answer some of her queries. She lined up $N$ minions in a straight line from $1$ to $N$. 
You are given an array $A$ which contains the height of minions. Agnes will ask him several queries. In each query, Gru has to tell whether the bitwise AND of  $A[L \ldots R]$ is EVEN or ODD. Since Gru is busy planning the biggest heist on Earth, he asks for your help.

-----Input:-----
- First line of the input contains an integer $T$ denoting the number of test cases.
For each test case:-
- First line contains an integer $N$ denoting the number of elements.
- Second line contains $N$ spaced integer representing array elements.
- Third line contains $Q$ representing number of query.
- Next $Q$ lines contains two integer $L$ and $R$ as defined above.

-----Output:-----
For each query, output "EVEN" or "ODD" without quotes.

-----Constraints-----
- $1 \leq T \leq 10$
- $1 \leq N \leq 10^5$
- $1 \leq A_i \leq 10^5$
- $1 \leq Q \leq 10^5$

-----Sample Input:-----
1
5
1 3 2 4 5
3
1 2 
1 5
3 4

-----Sample Output:-----
ODD
EVEN
EVEN

-----Explanation-----
- For the first query, the bitwise AND of 1 and 3 is 1, which is Odd. Hence the first output is ODD.
- For the third query, the bitwise AND of 2 and 4 is 0, which is Even. Hence the third output is EVEN.

Starter code:

Solutions:
# cook your dish here
for _ in range(int(input())):
 n=int(input())
 a=[int(x) for x in input().split()]
 sum=0
 for i in range(n):
  if a[i]%2==0:
   sum+=1
  a[i]=sum 
 q=int(input())
 while q:
  l,r=map(int,input().split())
  if l!=1:
   c=a[r-1]-a[l-2]
  else:
   c=a[r-1] 
  if c==0:
   print("ODD")
  else:
   print("EVEN")
  q-=1

t=int(input())
for o in range(t):
 n=int(input())
 l=list(map(int,input().split()))
 q=int(input())
 l1=[]
 c=0
 for i in l:
  if i%2==0:
   c+=1
   l1.append(c)
  else:
   l1.append(c)
 #print(l1)
 for v in range(q):
  l,r=map(int,input().split())
  l-=1
  r-=1 
  if l==0:
   if l1[r]>0:
    print("EVEN")
   else:
    print("ODD")
  else:
   l-=1
   x=l1[r]-l1[l]
   if x>0:
    print("EVEN")
   else:
    print("ODD")

for _ in range(int(input())):
 
 t = int(input())
 arr = list(map(int, input().split()))
 prearr = [0]
 cnt = 0
 
 for i in range(t):
  if arr[i]%2==0:
   cnt+=1
   
  prearr.append(cnt)
 
 for _ in range(int(input())):
  l,r = map(int, input().split())
  
  tot = prearr[r]-prearr[l-1]
  print("EVEN") if tot>0 else print("ODD")

for _ in range(int(input())):
 n=int(input())
 l=list(map(int,input().split()))
 k,c=[],0
 for i in l:
  if i%2==0:
   c+=1
  k.append(c)
 q=int(input())
 for i in range(q):
  a,b=map(int,input().split())
  a-=1
  b-=1
  if a==0:
   if k[b]>0:
    print("EVEN")
   else:
    print("ODD")
  else:
   a-=1
   x=k[b]-k[a]
   if x>0:
    print("EVEN")
   else:
    print("ODD")

# def find_and(arr):
#     ans = arr[0] 
#     for i in range(1, len(arr)):
#         ans = ans&arr[i]
#     return ans
# def checkEvenOdd(arr, n):
#   for i in range(n) :
#       if arr[i] % 2 == 0:
#           print("EVEN")
#           return
#   print("ODD")
# t = int(input())
# for _ in range(t):
#     N = int(input())
#     lst = list(map(int, input().split()))
#     Q = int(input())
#     Nlst = []
#     for _ in range(Q):
#         L, R = map(int, input().strip().split())
#         z = checkEvenOdd(lst[L-1:R], len(lst[L-1:R]))
for _ in range(int(input())):
 n=int(input())
 lis=list(map(int,input().split()))
 q=int(input())
 s=''
 for i in range(n):
  if (lis[i]&1)==0:
   s+='0'
  else:
   s+='1'
 for _ in range(q):
  x=list(map(int,input().split()))
  l=x[0]
  r=x[1]
  temp='1'*((r+1)-l)
  if temp==s[l-1:r]:
   print("ODD")
  else:
   print("EVEN")

t = int(input())
for cases in range(t):
 n = int(input())
 arr = list(map(int,input().strip().split()))
 odd = [0]*n
 if arr[0]%2==1:
  odd[0] = 1
 for i in range(1,n):
  if arr[i]%2==1:
   odd[i] = 1
  odd[i] += odd[i-1]
 qu = int(input())
 for q in range(qu):
  l,r = map(int,input().split())
  l = l-1
  r = r-1
  flag = 0
  c = odd[r]
  if l>0:
   c -= odd[l-1]
  if c == (r-l+1):
   print("ODD")
  else:
   print("EVEN")

t=int(input())
for _ in range(t):
 n=int(input())
 m=list(map(int,input().split()))
 p=[]
 temp=0
 for i in range(n):
  if(m[i]%2==0):
   m[i]=0
  else:
   m[i]=1
  temp=temp+m[i]
  p.append(temp)
 
 ans=[]
 q=int(input())
 for i in range(q):
  a,b=list(map(int,input().split()))
  a,b=a-1,b-1
  if(a>=1):
   temp=p[b]-p[a-1]
  else:
   temp=p[b]
  if(temp==(b-a+1)):
   print("ODD")
  else:
   print("EVEN")

t=int(input())
while(t):
 t=t-1
 n=int(input())
 a=list(map(int,input().split()))
 fin=[]
 fin.append(0)
 
 for i in range(n):
  if(a[i]%2==0):
   p=fin[-1]
   fin.append(p+1)
  else:
   p=fin[-1]
   fin.append(p)
   
   
 q=int(input())
 while(q>0):
  q=q-1
  r,ti=list(map(int,input().split()))
  m=fin[ti]
  n=fin[r-1]
  even=m-n
  if(even==0):
   print("ODD")
  else:
   print("EVEN")


t=int(input())
while(t):
 t=t-1
 n=int(input())
 a=list(map(int,input().split()))
 fin=[]
 fin.append(0)
 
 for i in range(n):
  if(a[i]%2==0):
   p=fin[-1]
   fin.append(p+1)
  else:
   p=fin[-1]
   fin.append(p)
   
   
 que=int(input())
 while(que>0):
  que=que-1
  r,ti=list(map(int,input().split()))
  m=fin[ti]
  n=fin[r-1]
  even=m-n
  if(even==0):
   print("ODD")
  else:
   print("EVEN")
  


t = int(input())
for _ in range(t):
 n = int(input())
 arr = list(map(int,input().split()))
 q = int(input())
 s = [0 for i in range(n)]
 ev = 0
 for i in range(n):
  if arr[i]%2==0:
   ev+=1
  s[i] = ev
 for i in range(q):
  l,r = list(map(int,input().split()))
  l-=1
  r-=1
  if arr[l]%2==0 or arr[r]%2==0:
   print('EVEN')
   continue
  diff = s[r] - s[l]
  if diff>0:
   print('EVEN')
  else:
   print('ODD')


for i in range(int(input())):
 n = int(input())
 y = [int(x) for x in input().split()]
 y = [x%2 for x in y]
 
 lst=[0]
 lst.extend(y)
 for j in range(n+1):
  if lst[j]==0:
   lst[j] = lst[j-1]+1
  else:
   lst[j]=lst[j-1]
 
 for j in range(int(input())):
  l,r =map(int,input().split())
  if lst[r]-lst[l-1]>0:
   print("EVEN")
  else:
   print("ODD")

for _ in range(int(input())):
 lens=int(input())
 arrs=[int(x) for x in input().split()]
 even=[i for i,x in enumerate(arrs) if x%2==0]
 nbq=int(input())
 for _ in range(nbq):
  answer="ODD"
  l,r=[int(x) for x in input().split()]
  for j in even:
   if(l-1)<=j<r:            
    answer="EVEN"
    break
  print(answer)

# cook your dish here
# your code goes here
for _ in range(int(input())):
 n = int(input())
 l=list(map(int,input().split()))
 m= int(input())
 prefix = [0 for i in range(n)]
 if l[0]%2==0:
  prefix[0]=1
 else:
  prefix[0]=0
 for k in range(1,n):
  if l[k]%2==0:
   prefix[k]=prefix[k-1]+1
  else:
   prefix[k]=prefix[k-1]
 #print(prefix)
 for i in range(m):
  l,r =list(map(int,input().split()))
  l-=1
  r-=1
  if prefix[r]-prefix[max(0,l-1)]>0:
   print("EVEN")
  else:
   print("ODD")


x=int(input())
for y in range(x):
 N=int(input())
 Z=list(map(int,input().split()))
 P=int(input())
 Z1=[0]
 count=0
 for q in range(N):
  if(Z[q]%2==0):
   count+=1
  Z1.append(count)
 
 for t in range(P):
  i,j=list(map(int,input().split()))
  if((Z1[j]-Z1[i-1])>0):
   print("EVEN")
  else:
   print("ODD")


t = int(input());
for test in range(t):
 n = int(input());
 arr = list(map(int,input().split()));
 check = [0 for i in range(n+2)];
 for i in range(n):
  check[i+1]=check[i];
  if(arr[i]%2==0):
   check[i+1]+=1;
 q = int(input());
 for i in range(q):
  l,r = list(map(int,input().split()));
  if(check[r]-check[l-1])>0:
   print("EVEN");
  else:
   print("ODD");
 


# cook your dish here
for _ in range(int(input())):
 n = int(input())
 a = list(map(int,input().split()))
 sum = []
 temp = 0
 for i in range(n):
  temp += a[i]%2
  sum.append(temp)
 q = int(input())
 # print(sum)
 while q!=0:
  q -= 1 
  l,r = [int(x) for x in input().split()]
  l -= 1 
  r -= 1 
  if sum[r]-sum[l]+a[l]%2==r-l+1:
   print("ODD")
  else:
   print("EVEN")


from bisect import *
t=int(input())
while(t):
 t-=1
 n=int(input())
 a=list(map(int,input().split()))
 a.append(0)
 ref=[]
 l=1
 r=0
 for i in range(n+1):
  if(a[i]%2):
   r+=1
  else:
   if(l and r):
    ref.append([l,r+l-1])
    l=i+2
    r=0
   l=i+2
 ref1=[]
 for i in ref:
  ref1.append([i[1],i[0]])
 #print(ref)
 q=int(input())
 while(q):
  q-=1
  l,r=list(map(int,input().split()))
  it=bisect_left(ref1,[l])
  if(l>=ref1[it][1] and r<=ref1[it][0]):
   print("ODD")
  else:
   print("EVEN")


for _ in range(int(input())):
 n=int(input())
 m=[0]
 c=0
 l1=list(map(int,input().split()))
 for i in range(len(l1)):
  if(l1[i]%2==0):
   c+=1
  m.append(c)
 #print(m)
 for _ in range(int(input())):
  l,r=list(map(int,input().split()))
  s=m[r]-m[l-1]
  if(s==0):
   print("ODD")
  else:
   print("EVEN")


for _ in range(int(input())):
 n=int(input())
 a=list(map(int,input().split()))
 MAT=[0]
 cur=0
 for i in range(n):
  if a[i]%2==0:
   cur+=1
  MAT.append(cur)
 for i in range(int(input())):
  l,r=map(int,input().split())
  if MAT[r]-MAT[l-1]==0:
    print("ODD")
  else:
   print("EVEN")

for _ in range(int(input())):
 n=int(input())
 a=list(map(int,input().split()))
 MAT=[0]
 cur=0
 for i in range(n):
  a[i]=str(bin(a[i]))[-1]
  if a[i]=='0':
   cur+=1
  MAT.append(cur)
 for i in range(int(input())):
  l,r=map(int,input().split())
  if MAT[r]-MAT[l-1]==0:
    print("ODD")
  else:
   print("EVEN")

# cook your dish here
t = int(input())
while t > 0:
 n = int(input())
 a = [int(ele) for ele in input().split()]
 for i in range(n):
  num = bin(a[i])
  if num[-1] == '1':
   a[i] = 1
  else:
   a[i] = 0
  if i != 0:
   a[i] += a[i-1]
 q = int(input())
 while q > 0:
  l, r = [int(ele) for ele in input().split()]
  x = a[r-1]
  if l==1:
   y = 0
  else:
   y = a[l-2]
  if (x-y == (r-l+1)):
   print("ODD")
  else:
   print("EVEN")
  q -= 1
 t -= 1
  


for _ in range(int(input())):
 n = int(input())
 a = list(map(int,input().split()))
 p = []; cnt = 0
 for i in range(n):
  if a[i]%2==0:
   cnt += 1
   p.append(cnt)
   cnt += 1
   continue
  p.append(cnt)
 for _ in range(int(input())):
  l,r = list(map(int,input().split()))
  if p[r-1]-p[l-1]>0:
   print('EVEN')
  else:
   print('ODD')


for _ in range(int(input())):
 n = int(input())
 a = list(map(int,input().split()))
 p = []; cnt = 0
 for i in range(n):
  if a[i]%2==0:
   cnt += 1
   p.append(cnt)
   cnt += 1
   continue
  p.append(cnt)
 for _ in range(int(input())):
  l,r = list(map(int,input().split()))
  if p[r-1]-p[l-1]>0:
   print('EVEN')
  else:
   print('ODD')


# cook your dish here
t=int(input())
while t>0:
 t-=1
 n=int(input())
 li=[]
 lis=list(map(int,input().split()))
 for i in range(n):
  if(lis[i]%2==0):
   li.append(i)
 q=int(input())
 for i in range(q):
  l,r=map(int,input().split())
  f=0
  for j in li:
   if(l-1<=j and j<r):
    f=1
    break
   if(j>=r):
    break
  if(f==1):
   print("EVEN")
  else:
   print("ODD")