/<> 14438 (top down seg tree)

#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];
int seg[MAXN * 4];

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

void update(int x, int s, int e, int idx, int val){
    if(idx < s || e < idx) return;
    if(s == e){
        seg[x] = val;
        return;
    }
    int mid = (s + e)/2;
    update(x * 2, s, mid, idx, val);
    update(x * 2 + 1, mid + 1, e, idx, val);
    seg[x] = min(seg[x * 2], seg[x * 2 + 1]);
}

int query(int x, int s, int e, int a, int b){
    if(e < a || b < s) return 2e9;
    if(a <= s && e <= b){
        return seg[x];
    }
    int mid = (s + e)/2;
    return min(query(x * 2, s, mid, a, b), query(x * 2 + 1, mid + 1, e, a, b));
}

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

/*
5
5 4 3 2 1
6
2 1 3
2 1 4
1 5 3
2 3 5
1 4 3
2 3 5
 */