#include <bits/stdc++.h>
using namespace std;
long long fastPower(long long base, long long exp, long long mod) {
  base %= mod;
  long long result = 1;
  while (exp > 0) {
    if (exp & 1) result = (result * base) % mod;
    base = (base * base) % mod;
    exp >>= 1;
  }
  return result;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long nCr(long long n, long long r, long long mod) {
  if (n < r) return 0;
  if (r == 0) return 1;
  return ((n % mod) * ((nCr(n - 1, r - 1, mod) / r) % mod)) % mod;
}
long long removeAt(long long code, int idx, int val, long long BASE,
                   long long mod) {
  return (code - (val * fastPower(BASE, idx, mod)) % mod + mod) % mod;
}
long long addAt(long long code, int idx, int val, long long BASE,
                long long mod) {
  return (code + (val * fastPower(BASE, idx, mod)) % mod) % mod;
}
long long shiftLeft(long long code, long long BASE, long long mod) {
  return (code * BASE) % mod;
}
long long shiftRight(long long code, long long BASE, long long mod) {
  return (code * fastPower(BASE, mod - 2, mod) % mod) % mod;
}
const int N = 1500;
int arr[N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &arr[i]);
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = i + 1; j <= n; ++j) {
      if (arr[j] < arr[i]) ++ans;
    }
  }
  ans &= 1;
  int q, l, r;
  scanf("%d", &q);
  while (q--) {
    scanf("%d", &l);
    scanf("%d", &r);
    if ((((r - l + 1) / 2) & 1) == 1) ans ^= 1;
    if ((ans & 1) == 1)
      printf("odd\n");
    else
      printf("even\n");
  }
}
