#include <bits/stdc++.h>
using namespace std;
void updateBIT(int BITree[], int n, int index, int val);
int getSum(int BITree[], int index);
int main() {
  int n;
  scanf("%d", &n);
  int arr[n];
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  int m;
  scanf("%d", &m);
  int BITree[n + 1];
  for (int i = 0; i < n + 1; i++) BITree[i] = 0;
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    ans += (i - getSum(BITree, arr[i]));
    updateBIT(BITree, n, arr[i], 1);
  }
  for (int q = 0; q < m; q++) {
    int l, r;
    scanf("%d %d", &l, &r);
    int swaps = (r - l + 1) / 2;
    ans += swaps;
    if (ans % 2 == 1)
      printf("odd\n");
    else
      printf("even\n");
  }
  return 0;
}
int getSum(int BITree[], int index) {
  int sum = 0;
  while (index > 0) {
    sum += BITree[index];
    index -= index & (-index);
  }
  return sum;
}
void updateBIT(int BITree[], int n, int index, int val) {
  while (index <= n) {
    BITree[index] += val;
    index += index & (-index);
  }
}
