source_code: /*
  Keep solving problems.
  */
  
  import java.util.*;
  import java.io.*;
  
  public class CFA {
      BufferedReader br;
      PrintWriter out;
      StringTokenizer st;
      boolean eof;
      final long MOD = 1000L * 1000L * 1000L + 7;
      int[] dx = {0, -1, 0, 1};
      int[] dy = {1, 0, -1, 0};
  
      void solve() throws IOException {
          int n = nextInt();
          int[] arr = nextIntArr(n);
          int cnt = 0;
          for (int i = 0; i < n; i++) {
              for (int j = i + 1; j < n; j++) {
                  if (arr[i] > arr[j]) {
                      cnt++;
                  }
              }
          }
          int m = nextInt();
          boolean[] vis = new boolean[n];
          for (int i = 0; i < m; i++) {
              int l = nextInt() - 1;
              int r = nextInt() - 1;
              int len = r - l + 1;
              if (len * (len - 1) / 2 % 2 != 0) {
                  cnt++;
              }
  
              if (cnt % 2 != 0) {
                  outln("odd");
              }
              else {
                  outln("even");
              }
          }
      }
  
      void shuffle(int[] a) {
          int n = a.length;
          for(int i = 0; i < n; i++) {
              int r = i + (int) (Math.random() * (n - i));
              int tmp = a[i];
              a[i] = a[r];
              a[r] = tmp;
          }
      }
  
      long gcd(long a, long b) {
          while(a != 0 && b != 0) {
              long c = b;
              b = a % b;
              a = c;
          }
          return a + b;
      }
  
      private void outln(Object o) {
          out.println(o);
      }
      private void out(Object o) {
          out.print(o);
      }
      public CFA() throws IOException {
          br = new BufferedReader(new InputStreamReader(System.in));
          out = new PrintWriter(System.out);
          solve();
          out.close();
      }
      public static void main(String[] args) throws IOException {
          new CFA();
      }
  
      public long[] nextLongArr(int n) throws IOException{
          long[] res = new long[n];
          for(int i = 0; i < n; i++)
              res[i] = nextLong();
          return res;
      }
      public int[] nextIntArr(int n) throws IOException {
          int[] res = new int[n];
          for(int i = 0; i < n; i++)
              res[i] = nextInt();
          return res;
      }
      public String nextToken() {
          while (st == null || !st.hasMoreTokens()) {
              try {
                  st = new StringTokenizer(br.readLine());
              } catch (Exception e) {
                  eof = true;
                  return null;
              }
          }
          return st.nextToken();
      }
      public String nextString() {
          try {
              return br.readLine();
          } catch (IOException e) {
              eof = true;
              return null;
          }
      }
      public int nextInt() throws IOException {
          return Integer.parseInt(nextToken());
      }
      public long nextLong() throws IOException {
          return Long.parseLong(nextToken());
      }
      public double nextDouble() throws IOException {
          return Double.parseDouble(nextToken());
      }
  }
  
  