#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 1;
int bit[N] = {0};
void update(int x, int val) {
  for (; x <= N; x += x & (-x)) bit[x] += val;
}
int query(int x) {
  int sum = 0;
  for (; x >= 1; x -= x & (-x)) sum += bit[x];
  return sum;
}
int a[N];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  int ans = 0;
  for (int i = n - 1; i >= 0; i--) {
    int ele = a[i];
    ans += query(a[i]);
    update(a[i], 1);
  }
  int q;
  cin >> q;
  while (q--) {
    int a, b;
    cin >> a >> b;
    int r = b - a;
    int x = r * (r + 1);
    x /= 2;
    ans += x;
    if (ans % 2 == 0)
      cout << "even\n";
    else
      cout << "odd\n";
  }
  return 0;
}
