#include <bits/stdc++.h>   using namespace std;   int a[1505];   int main() {     int n;     scanf( %d , &n);     for (int i = 1; i <= n; i++) scanf( %d , &a[i]);     int ans = 0;     for (int i = 1; i <= n; i++)       for (int j = 1; j <= i - 1; j++)         if (a[j] > a[i]) ans ^= 1;     int q;     scanf( %d , &q);     while (q--) {       int a, b;       scanf( %d%d , &a, &b);       int sz = b - a + 1;       sz = sz * (sz - 1) / 2;       if (sz % 2 == 1) ans ^= 1;       if (ans == 0)         printf( even n );       else         printf( odd n );     }   }   