Problem: Write a program which manipulates a sequence $A = \\{a_0, a_1, ..., a_{n-1}\\}$ by the following operations:

* min($b, e$): report the minimum element in $a_b, a_{b+1}, ..., a_{e-1}$
* max($b, e$): report the maximum element in $a_b, a_{b+1}, ..., a_{e-1}$

Constraints

* $1 \leq n \leq 1,000$
* $-1,000,000,000 \leq a_i \leq 1,000,000,000$
* $1 \leq q \leq 1,000$
* $0 \leq b < e \leq n$

Input

The input is given in the following format.


$n$
$a_0 \; a_1, ..., \; a_{n-1}$
$q$
$com_1 \; b_1 \; e_1$
$com_2 \; b_2 \; e_2$
:
$com_{q} \; b_{q} \; e_{q}$


In the first line, $n$ (the number of elements in $A$) is given. In the second line, $a_i$ (each element in $A$) are given. In the third line, the number of queries $q$ is given and each query is given in the following $q$ lines. $com_i$ denotes a type of query. 0 and 1 represents min($b, e$) and max($b, e$) respectively.

Output

For each query, print the minimum element or the maximum element in a line.

Example

Input

7
8 3 7 1 9 1 4
3
0 0 3
0 1 5
1 0 7


Output

3
1
9

Solution (in JAVA):

Solution:
//import java.lang.Math;
import java.util.*;
//import java.util.ListIterator;
//import java.util.Iterator;
//import java.util.LinkedList;


class Main{
	
	public static void main(String[] arg){
		
	

		int a=0,b=0;
		Scanner sc= new Scanner(System.in);
		List<Integer> list =new ArrayList<Integer>();
		int m=sc.nextInt();
		int[] str=new int[m];
		for(int i=0;i<m;i++){
			str[i]=sc.nextInt();
			list.add(new Integer(str[i]));
		}
		int n=sc.nextInt();
		for(int j=0;j<n;j++){
			int d=sc.nextInt();
			switch(d){
			case 0:
				a=sc.nextInt();
			    b=sc.nextInt();
			   
				List<Integer> l2=list.subList(a, b);
				int c=Collections.min(l2);
				System.out.println(c);
				break;
			case 1:
				
				a=sc.nextInt();
			    b=sc.nextInt();
					List<Integer> l3=list.subList(a, b);
				int q=Collections.max(l3);
				System.out.println(q);
				break;
			}
		}
	}}