#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7, OO = 2e9 + 100;
const int N = 1000 + 510;
int n, m, a[N];
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= i; ++j) {
      if (a[i] < a[j]) ++ans;
    }
  }
  ans %= 2;
  cin >> m;
  while (m-- > 0) {
    int l, r;
    cin >> l >> r;
    int path = r - l + 1;
    int full = path * (path - 1) / 2;
    if ((ans + full) % 2 == 1)
      cout << "odd" << endl;
    else
      cout << "even" << endl;
    ans += full;
    ans %= 2;
  }
}
