#include <bits/stdc++.h>
using namespace std;
int count_inversions(vector<int>& v) {
  int n = int(v.size());
  if (n == 1) {
    return 0;
  }
  int n1 = n / 2;
  vector<int> v1(v.begin(), v.begin() + n1);
  vector<int> v2(v.begin() + n1, v.end());
  int cnt = count_inversions(v1) ^ count_inversions(v2);
  for (int i1 = 0, i2 = 0, i = 0; i1 < int(v1.size()) || i2 < int(v2.size());) {
    if (i1 < int(v1.size()) && (i2 == int(v2.size()) || v1[i1] < v2[i2])) {
      v[i++] = v1[i1++];
    } else {
      cnt ^= (((int)v1.size() - i1) & 1);
      v[i++] = v2[i2++];
    }
  }
  return cnt;
}
bool solve() {
  int n;
  if (scanf("%d", &n) != 1) {
    return false;
  }
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    assert(scanf("%d", &a[i]) == 1);
  }
  int cur = count_inversions(a);
  int m;
  assert(scanf("%d", &m) == 1);
  for (int i = 0; i < m; ++i) {
    int L, R;
    scanf("%d%d", &L, &R);
    int k = R - L + 1;
    if (k % 4 != 0 && (k - 1) % 4 != 0) {
      cur ^= 1;
    }
    printf("%s\n", cur ? "odd" : "even");
  }
  return true;
}
int main() {
  while (solve())
    ;
  return 0;
}
