#include <bits/stdc++.h>
const double pi = acos(-1.0);
using namespace std;
int n;
int a[1510], b[1510], c[1510];
void update(int i, int val) {
  while (i <= n) {
    c[i] += val;
    i += ((i) & (-i));
  }
}
int sum(int i) {
  int ret = 0;
  while (i > 0) {
    ret += c[i];
    i -= ((i) & (-i));
  }
  return ret;
}
int main() {
  cin >> n;
  memset(a, 0, sizeof a);
  memset(c, 0, sizeof c);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    ans += (i - sum(a[i]));
    update(a[i], 1);
  }
  int m;
  cin >> m;
  while (m--) {
    int aa, bb;
    scanf("%d%d", &aa, &bb);
    aa--;
    bb--;
    if ((((bb - aa + 1) / 2) % 2) == 1) ans++;
    if (ans % 2 == 1)
      cout << "odd" << endl;
    else
      cout << "even" << endl;
  }
  return 0;
}
