#include <bits/stdc++.h>
using namespace std;
int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};
template <typename T>
inline T BigMod(T A, T B) {
  T ret = 1;
  while (B) {
    if (B & 1) ret = (ret * A) % 1000000007;
    A = (A * A) % 1000000007;
    B = B >> 1;
  }
  return ret;
}
template <typename T>
inline T InvMod(T A, T M = 1000000007) {
  return BigMod(A, M - 2);
}
string tostring(long long int res) {
  string curstr = "";
  while (res != 0) {
    long long int temp = (res % 10);
    curstr += ((char)temp + '0');
    res /= 10;
  }
  reverse(curstr.begin(), curstr.end());
  return curstr;
}
long long int toint(string ss) {
  long long int inss = 0;
  for (int i = 0; i < ss.size(); i++) {
    inss = (inss * 10) + ((int)(ss[i] - '0'));
  }
  return inss;
}
int ar[1503], n, m;
int main() {
  while (cin >> n) {
    for (int i = 0; i < n; i++) cin >> ar[i];
    int cnt = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < i; j++) {
        if (ar[j] > ar[i]) cnt++;
      }
    }
    scanf("%d", &m);
    int u, v, track = (cnt & 1);
    while (m--) {
      scanf("%d %d", &u, &v);
      int ind = (v - u) + 1;
      int pairs = (ind * (ind - 1)) / 2;
      if (pairs & 1) track = 1 - track;
      track ? printf("odd\n") : printf("even\n");
    }
  }
  return 0;
}
