Given an array $A_1, A_2, \ldots, A_N$ of length $N$. Write a program to process the following queries:

• 1 i v: Change $A_i$ to $v$. ($1 \le i \le N$, $1 \le v \le 10^9$)
• 2: Output the index of the minimum value in the array. If there are multiple minima, output the smallest index.

Indices start from 1.

Input

The first line contains the length $N$ of the array. ($1 \le N \le 100{,}000$)

The second line contains $A_1, A_2, \ldots, A_N$. ($1 \le A_i \le 10^9$)

The third line contains the number of queries $M$. ($1 \le M \le 100{,}000$)

The next $M$ lines each contain a query.

Output

For each query of type 2, output one answer per line in order.

Examples

Input 1

5
5 4 3 2 1
5
2
1 5 3
2
1 4 3
2

Output 1

5
4
3