#include <bits/stdc++.h>
using namespace std;
template <class T>
int size(const T &x) {
  return x.size();
}
const int INF = ~(1 << 31);
const double EPS = 1e-9;
const double pi = acos(-1);
template <class T>
T smod(T a, T b) {
  return (a % b + b) % b;
}
int main() {
  int n, m;
  scanf("%d", &n);
  vector<int> perm(n);
  for (__typeof(0) i = (0); i < (n); ++i) {
    scanf("%d", &perm[i]);
  }
  scanf("%d", &m);
  long long inv = 0;
  for (__typeof(0) i = (0); i < (n); ++i) {
    for (__typeof(i + 1) j = (i + 1); j < (n); ++j) {
      if (perm[j] < perm[i]) {
        inv++;
      }
    }
  }
  int par = inv % 2;
  for (__typeof(0) i = (0); i < (m); ++i) {
    int l, r;
    cin >> l >> r;
    long long len = r - l + 1;
    if ((len * (len - 1) / 2) % 2) {
      par = (par + 1) % 2;
    }
    if (par) {
      cout << "odd" << endl;
    } else {
      cout << "even" << endl;
    }
  }
}
