#include <bits/stdc++.h>
using namespace std;
const int M = 1507;
const long long mod = 1e9 + 7;
const long double esl = 1e-5;
int t[M];
int n;
int a[M];
void swapp(int l, int r) {
  for (int i = 0; i <= (r - l) / 2; i++) swap(a[i + l], a[r - i]);
}
int getBIT(int m) {
  int result = 0;
  for (; m > 0; m &= m - 1) {
    result += t[m];
  }
  return result;
}
void updateBIT(int m, int value) {
  for (; m <= n; m += m & -m) {
    t[m] += value;
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  int kq = 0;
  for (int i = 0; i <= n; i++) t[i] = 0;
  for (int i = n; i >= 1; i--) {
    kq += getBIT(a[i]);
    updateBIT(a[i] + 1, 1);
  }
  bool x = kq & 1;
  int m, l, r;
  cin >> m;
  while (m--) {
    cin >> l >> r;
    int t = r - l + 1;
    t = t * (t - 1) / 2;
    if (t & 1) x = !x;
    if (x & 1)
      cout << "odd\n";
    else
      cout << "even\n";
  }
}
