Identify the time complexity of the following code as constant, linear, quadratic, cubic, log(n), nlog(n) or NP-hard. //package Educational35;

//import FastScanner.Competitive;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class D {
        String INPUT = "4\n" +
                "1 2 4 3\n" +
                "4\n" +
                "1 1\n" +
                "1 4\n" +
                "1 4\n" +
                "2 3";

        void solve()
        {
                final int n = i();
                final int[] a = ia(n);
                int count = 0 ;
                for(int i = 0 ; i<n-1 ; i++)
                {
                        for(int j = i+1; j<n ; j++)
                        {
                                if(a[j]<a[i])
                                {
                                        count++;
                                }
                        }
                }
                final int q = i();
                for(int i = 0 ; i<q ; i++)
                {
                        final int l = i(), r=i();
                        final int mid = (r-l+1)/2;
                        if(mid%2==0)
                        {
                                out.println(count%2==0?"even":"odd");
                        }
                        else
                        {
                                count++;
                                out.println(count%2==0?"even":"odd");
                        }
                }


        }
        ///////////////////////////////////////
        void run() throws Exception{
                is = oj ? System.in: new ByteArrayInputStream(INPUT.getBytes());
                //is = System.in;
                out = new PrintWriter(System.out);
                int t = 1;
                while(t-->0)	solve();
                out.flush();
        }
        public static void main(String[] args)throws Exception {
                new D().run();
        }
        InputStream is;
        PrintWriter out;
        private... Complexity: