#include <bits/stdc++.h>
using namespace std;
int num[1505];
int c[1505];
inline int lowbit(int x) { return x & (-x); }
inline int query(int x) {
  int ans = 0;
  while (x < 1505) {
    ans += c[x];
    x += lowbit(x);
  }
  return ans;
}
inline void update(int x, int val) {
  while (x > 0) {
    c[x] += val;
    x -= lowbit(x);
  }
}
int main() {
  int n;
  scanf("%d", &n);
  int rev = 0;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &num[i]);
    rev += query(num[i]);
    update(num[i], 1);
  }
  int m;
  scanf("%d", &m);
  int ans = rev & 1;
  for (int i = 0; i < m; ++i) {
    int l, r;
    scanf("%d%d", &l, &r);
    int len = r - l + 1;
    if ((len % 4 == 1 || len % 4 == 0)) {
      ans = ans;
    } else {
      ans = !ans;
    }
    puts(ans ? "odd" : "even");
  }
}
