#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T = int>
struct Fenwick {
  vector<T> t;
  T tn;
  Fenwick(int _n) {
    assert(_n > 0);
    tn = _n;
    t = vector<T>(tn + 1, 0);
  }
  void update(int x, T val) {
    x++;
    while (x <= tn) {
      t[x] += val;
      x += (x & -x);
    }
  }
  T query(int x) {
    assert(x < tn);
    x++;
    int res = 0;
    while (x > 0) {
      res += t[x];
      x -= (x & -x);
    }
    return res;
  }
  T query(int l, int r) {
    assert(l <= r);
    if (l == 0) return query(r);
    return query(r) - query(l - 1);
  }
  int find_last_prefix(T sum) {
    if (sum < 0) return -1;
    int pref = 0;
    for (int k = 31 - __builtin_clz(tn); k >= 0; k--) {
      if (pref + (1 << k) <= tn && t[pref + (1 << k)] <= sum) {
        pref += 1 << k;
        sum -= t[pref];
      }
    }
    return pref;
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m;
  cin >> n;
  vector<int> p(n);
  for (auto& x : p) cin >> x;
  int isodd = 0;
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++)
      if (p[i] > p[j]) isodd ^= 1;
  cin >> m;
  while (m--) {
    int l, r;
    cin >> l >> r;
    int swaps = (r - l + 1);
    swaps = swaps * (swaps - 1) / 2;
    isodd ^= (swaps & 1);
    if (isodd)
      cout << "odd\n";
    else
      cout << "even\n";
  }
}
