#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e10;
template <typename T>
void cmax(T &a, T b) {
  a = max(a, b);
}
template <typename T>
void cmin(T &a, T b) {
  a = min(a, b);
}
vector<long long> a;
long long bit[100005];
long long n;
long long sum(long long i) {
  long long s = 0;
  while (i > 0) {
    s += bit[i];
    i -= i & -i;
  }
  return s;
}
void add(long long i, long long x) {
  while (i <= n) {
    bit[i] += x;
    i += i & -i;
  }
}
long long solve() {
  long long ans = 0;
  for (long long j = 0; j < n; j++) {
    ans += j - sum(a[j]);
    add(a[j], 1);
  }
  return ans;
}
signed main() {
  cin >> n;
  a.resize(n);
  for (long long i = 0; i < (n); i++) cin >> a[i];
  long long inversion = solve();
  bool isEven = true;
  if (inversion % 2 == 1) isEven = false;
  long long m;
  cin >> m;
  while (m--) {
    long long l, r;
    cin >> l >> r;
    long long range = r - l + 1;
    if (range * (range - 1) / 2 % 2 == 0) {
    } else {
      if (isEven)
        isEven = false;
      else
        isEven = true;
    }
    cout << (isEven ? "even" : "odd") << endl;
  }
  return 0;
}
