#include <bits/stdc++.h>
using namespace std;
int n, q, per[1501], a, b, res;
int vis[1501], id = 0;
void change(int x, int y) {
  for (int i = x - 1, idx = y - 1; i < idx; i++, idx--) {
    swap(per[i], per[idx]);
  }
  res = 0;
  id++;
  for (int i = 0; i < n; i++) {
    if (vis[i] != id) {
      vis[i] = id;
      int idx = per[i];
      while (vis[idx] != id) {
        vis[idx] = id;
        idx = per[idx];
        res++;
      }
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &per[i]);
    per[i]--;
  }
  scanf("%d", &q);
  while (q--) {
    scanf("%d %d", &a, &b);
    change(a, b);
    printf(res % 2 ? "odd\n" : "even\n");
  }
}
