/<> 14428 (top down seg tree carry root)

#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <unordered_map>
#include <numeric>
#include <iomanip>
using namespace std;
#define pii pair<long long, long long>
#define ll long long
#define FAST ios_base::sync_with_stdio(false); cin.tie(NULL)
const long long dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
const long long dl[2] = {1, -1};
const long long MOD = 1000000007;
const long long MAXN = 100005;

int N, M;
int arr[MAXN];
pii seg[MAXN * 4];

void build(int x, int s, int e){
    if(s == e){
        seg[x] = {arr[s], s};
        return;
    }
    int mid = (s + e) / 2;
    build(x * 2, s, mid);
    build(x * 2 + 1, mid + 1, e);
    if(seg[x * 2].first <= seg[x * 2 + 1].first){
        seg[x] = seg[x * 2];
    }
    else{
        seg[x] = seg[x * 2 + 1];
    }
}

void update(int x, int s, int e, int idx, int val){
    if(idx < s or idx > e) return;
    if(s == e){
        seg[x] = {val, idx};
        return;
    }
    int mid = (s + e) / 2;
    update(x * 2, s, mid, idx, val);
    update(x * 2 + 1, mid + 1, e, idx, val);
    if(seg[x * 2].first <= seg[x * 2 + 1].first){
        seg[x] = seg[x * 2];
    }
    else{
        seg[x] = seg[x * 2 + 1];
    }
}

pii query(int x, int s, int e, int a, int b){
    if(e < a or s > b) return {2e9, -1};
    if(a <= s and e <= b) return seg[x];

    int mid = (s + e) / 2;
    pii q1 = query(x * 2, s, mid, a, b);
    pii q2 = query(x * 2 + 1, mid + 1, e, a, b);
    if(q1.first <= q2.first){
        return q1;
    }
    else{
        return q2;
    }
}


int main() {
    FAST;
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> arr[i];
    }
    build(1, 1, N);
    cin >> M;
    for(int a, b, c, i = 1; i <= M; i++){
        cin >> a >> b >> c;
        if(a == 1){
            update(1, 1, N, b, c);
        }
        else{
            if(b > c){
                swap(b, c);
                arr[b] = c;
            }
            cout << query(1, 1, N, b, c).second << "\n";
        }
    }
}