//~~~~~~~~~~~~~~~~~~~~~~~@@@@@@@@@@@@@@@_____________K_____S_____J__________@@@@@@@@@@@@@@@@@@@@@@@@@@@@~~~~~~~~~~~~~~~~~~~~~~~~~~
    //Date:00/00/17
    //-------------


import java.util.*;
import java.io.*;

/*

    [[[[[[[[[[[[[[[      ]]]]]]]]]]]]]]]
    [::::::::::::::      ::::::::::::::]
    [::::::::::::::      ::::::::::::::]
    [::::::[[[[[[[:      :]]]]]]]::::::]
    [:::::[                      ]:::::]
    [:::::[                      ]:::::]
    [:::::[                      ]:::::]
    [:::::[                      ]:::::]
    [:::::[    CODE YOUR LIFE    ]:::::]
    [:::::[   Kripa Shankar jha  ]:::::]
    [:::::[                      ]:::::]
    [:::::[                      ]:::::]
    [:::::[                      ]:::::]
    [:::::[                      ]:::::]
    [::::::[[[[[[[:      :]]]]]]]::::::]
    [::::::::::::::      ::::::::::::::]
    [::::::::::::::      ::::::::::::::]
    [[[[[[[[[[[[[[[      ]]]]]]]]]]]]]]]
*/

public class prob3{
  

    static Parser sc=new Parser(System.in);
    static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
  
  static int p[]=new int[100005];
  public static void main(String[] args) throws IOException {
    // use ((((((( sc ............... for input

   
    int n=sc.nextInt();

    int arr[]=new int[n];

    for(int i=0;i<n;i++){
      arr[i]=sc.nextInt();
    }

    int swap=0;

    for(int i=0;i<n;i++){
      for(int j=0;j<i;j++){
        if(arr[i]<arr[j]){
           swap++; 
        }
      }
    }

    swap%=2;


    int m=sc.nextInt();

    for(int i=0;i<m;i++){

      int a=sc.nextInt(),b=sc.nextInt();
      swap+=((b-a)*((b-a)+1))/2;

      swap%=2;

      if(swap%2==0){System.out.println("even");}
      else{System.out.println("odd");}
    }


          
  }

   

public static void union(int a,int b){
        int i=find(a);
        int j=find(b);

        if(p[i]!=j){
          p[i]=j;
        }
      }


      public static int find(int a){

        while(p[a]!=a){
          a=p[a];
        }

       ... Which one is the correct time complexity of the code snippet: constant, linear, quadratic, cubic, log(n), nlog(n) or NP-hard?