#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr int MOD = 1e9 + 7;
constexpr int MAXN = 1505;
int N, M, K, Q;
int a[MAXN], b[MAXN], c[MAXN];
void preprocess() {}
void inver(int l, int r) {
  if (r - l == 1) return;
  int m = l + (r - l >> 1);
  inver(l, m);
  inver(m, r);
  int i = l, j = m;
  int k = l;
  while (i < m && j < r) {
    if (b[i] < b[j]) {
      c[k++] = b[i++];
    } else {
      c[k++] = b[j++];
      K += m - i;
    }
  }
  while (i < m) c[k++] = b[i++];
  while (j < r) c[k++] = b[j++];
  memcpy(b + l, c + l, sizeof(c[0]) * (r - l));
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
  while (cin >> N) {
    for (int i = 0; i < N; ++i) {
      cin >> a[i];
    }
    memcpy(b, a, sizeof a);
    K = 0;
    inver(0, N);
    K = (K % 2);
    cin >> M;
    while (M--) {
      int l, r;
      cin >> l >> r;
      int t = (r - l) * (r - l + 1) / 2;
      if (t % 2 == 1) {
        K = !K;
      }
      if (K)
        cout << "odd\n";
      else
        cout << "even\n";
    }
  }
  return 0;
}
