#include <iostream>
#include <queue>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 5;
const int INF = 2e9;
pair<int, int> segment_tree[3 * maxn];
int a[maxn];
int n;

pair<int, int> merge_nodes(pair<int, int> A, pair<int, int> B) {
    vector<int> v = {A.first, A.second, B.first, B.second};
    sort(v.begin(), v.end());

    return {v[2], v[3]};
}
void build_tree(int L, int R, int node) {
    if(L == R) {
        segment_tree[node] = {a[L], -INF};
    }
    else {
        int middle = (L + R) / 2;
        build_tree(L, middle, 2 * node);
        build_tree(middle + 1, R, 2 * node + 1);
        segment_tree[node] = merge_nodes(segment_tree[2 * node], segment_tree[2 * node + 1]);
    }
}

// L R i L R j L R
pair<int, int> query(int i, int j, int L = 0, int R = n - 1, int node = 1) {
    if(i <= L and R <= j) {
        return segment_tree[node];
    }
    if(R < i or j < L) {
        return {-INF, -INF};
    }
    int middle = (L + R) / 2;
    return merge_nodes(query(i, j, L, middle, 2 * node), query(i, j, middle + 1, R, 2 * node + 1));
}

void update(int idx, int new_value, int L = 0, int R = n - 1, int node = 1) {
    if(L == R) {
        segment_tree[node] = {new_value, -INF};
    }
    else {
        int middle = (L + R) / 2;
        if(idx <= middle) {
            update(idx, new_value, L, middle, 2 * node);
        }
        else {
            update(idx, new_value, middle + 1, R, 2 * node + 1);
        }

        segment_tree[node] = merge_nodes(segment_tree[2 * node], segment_tree[2 * node + 1]);
    }
}
int main()
{
    ios_base::sync_with_stdio(false);

    cin >> n;

    for(int i = 0; i < n; i++) {
        cin >> a[i];
    }

    build_tree(0, n - 1, 1);
    int k;
    cin >> k;
    for(int i = 0; i < k; i++) {
        char t;
        cin >> t;
        if(t == 'U') {
            int idx, value;
            cin >> idx >> value;
            update(idx - 1, value);
        }
        else {
            int x, y;
            cin >> x >> y;
            pair<int, int> res = query(x - 1, y - 1);
            cout << res.first + res.second << "\n";
        }
    }
    return 0;
}