#include <bits/stdc++.h>
using namespace std;
int cntinv(vector<int> &a) {
  int n = a.size();
  int ans = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      if (a[j] < a[i]) ans++;
    }
  }
  return ans;
}
int main(int argc, char const *argv[]) {
  int n;
  scanf("%d", &n);
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
  }
  int pv = (cntinv(a) & 1);
  int m;
  scanf("%d", &m);
  while (m--) {
    int l, r, swaps;
    scanf("%d", &l);
    scanf("%d", &r);
    l--;
    r--;
    swaps = (r - l + 1) >> 1;
    int cur = pv;
    if (swaps & 1) cur = 1 - cur;
    if (cur)
      printf("odd\n");
    else
      printf("even\n");
    pv = cur;
  }
  return 0;
}
