#include <bits/stdc++.h>
using namespace std;
const int maxn = 1509;
int a[maxn], n, m, l, r, ans;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    for (int j = 1; j <= i - 1; j++)
      if (a[j] > a[i]) ans ^= 1;
  }
  scanf("%d", &m);
  while (m--) {
    scanf("%d%d", &l, &r);
    ans ^= (((r - l) * (r - l + 1) / 2) & 1);
    if (ans)
      puts("odd");
    else
      puts("even");
  }
  return 0;
}
