#include <bits/stdc++.h>   using namespace std;   int n;   int a[1501];   int calcinv() {     int j;     int rez = 0;     for (int i = 1; i <= n; i++)       for (j = i + 1; j <= n; j++)         if (a[i] > a[j]) rez++;     return rez;   }   int main() {     int i, nri, j, m, l, r, lg;     cin >> n;     for (i = 1; i <= n; i++) cin >> a[i];     nri = calcinv() % 2;     cin >> m;     for (i = 1; i <= m; i++) {       cin >> l >> r;       lg = r - l;       lg = lg * (lg + 1) / 2;       nri = (nri + lg) % 2;       if (nri == 0)         cout <<  even ;       else         cout <<  odd ;       cout <<   n ;     }   }   