#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[2048];
int CntSmaller[2048];
int b[2048];
int CntInversions;
int parity;
void merge_sort(int left, int right) {
  if (left == right) return;
  int middle = left + right;
  middle >>= 1;
  merge_sort(left, middle);
  merge_sort(middle + 1, right);
  int index = left;
  int index1, index2 = middle + 1;
  for (index1 = left; index1 <= middle; index1++) {
    while (index2 <= right && a[index2] < a[index1]) {
      b[index] = a[index2];
      index2++;
      index++;
    }
    parity += index2 - middle - 1;
    b[index] = a[index1];
    index++;
  }
  for (int i = left; i <= right; i++) a[i] = b[i];
  return;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++) {
      if (a[i] > a[j]) parity ^= 1;
    }
  cin >> m;
  for (int i = 0; i < m; i++) {
    int left, right;
    cin >> left >> right;
    int lenght = right - left + 1;
    int now = lenght;
    now *= lenght - 1;
    now >>= 1;
    parity += now;
    parity &= 1;
    if (parity)
      cout << "odd" << endl;
    else
      cout << "even" << endl;
  }
  return 0;
}
