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
#include <iostream>
using namespace std;

long min(int b,int e, long* A);
long max(int b,int e, long* A);

int main(void){
  int n,q;
  int com,b,e;
  cin>>n;
  long A[n];
  for(int i=0;i<n;i++){
    cin>>A[i];
  }
  cin>>q;
  for(int i=0;i<q;i++){
    cin>>com>>b>>e;
    if(com==0){
      cout<<min(b,e,A)<<endl;
    }
    else{
      cout<<max(b,e,A)<<endl;
    }
  }
  return 0;
}


long min(int b,int e,long* A){
  long retval=1000000010;
  for(int i=b;i<e;i++){
    if(retval>A[i]){
      retval=A[i];
    }
  }
  return retval;
}

long max(int b,int e,long* A){
  long retval=-1000000010;
  for(int i=b;i<e;i++){
    if(retval<A[i]){
      retval=A[i];
    }
  }
  return retval;
}

