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
readline = open(0).readline
writelines = open(1, 'w').writelines

N = int(readline())
A = map(int, readline().split())

N0 = 2**(N-1).bit_length()
D1 = [0]*(2*N0); D2 = [0]*(2*N0)

for i, a in enumerate(A):
    D1[i+N0-1] = D2[i+N0-1] = a

for i in range(N0-2, -1, -1):
    D1[i] = min(D1[2*i+1], D1[2*i+2])
    D2[i] = max(D2[2*i+1], D2[2*i+2])

def query_min(l, r):
    L = l + N0; R = r + N0
    s = 1e9
    while L < R:
        if R & 1:
            R -= 1
            s = min(s, D1[R-1])

        if L & 1:
            s = min(s, D1[L-1])
            L += 1
        L >>= 1; R >>= 1
    return s
def query_max(l, r):
    L = l + N0; R = r + N0
    s = -1e9
    while L < R:
        if R & 1:
            R -= 1
            s = max(s, D2[R-1])

        if L & 1:
            s = max(s, D2[L-1])
            L += 1
        L >>= 1; R >>= 1
    return s


C = [query_min, query_max].__getitem__
Q = int(readline())
ans = []
for q in range(Q):
    t, b, e = map(int, readline().split())
    ans.append("%d\n" % C(t)(b, e))
writelines(ans)

