#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <numeric>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>

/*
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("section-anchors")
#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
#pragma GCC optimize("vpt")
#pragma GCC optimize("rename-registers")
#pragma GCC optimize("move-loop-invariants")
#pragma GCC optimize("unswitch-loops")
#pragma GCC optimize("function-sections")
#pragma GCC optimize("data-sections")
#pragma GCC optimize("branch-target-load-optimize")
#pragma GCC optimize("branch-target-load-optimize2")
#pragma GCC optimize("btr-bb-exclusive")
*/

//#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

//const int INF = 1e13;
//const int mod = 2600000069;
//const int p = 179;

vector<int> a, t;

void build(int v, int l, int r) {
    if (r - l == 1) {
        t[v] = (a[l] == 0);
        return;
    }
    int m = (l + r) / 2;
    build(2 * v + 1, l, m);
    build(2 * v + 2, m, r);
    t[v] = t[2 * v + 1] + t[2 * v + 2];
}

void update(int v, int l, int r, int pos, int val) {
    if (r - l == 1) {
        t[v] = (val == 0);
        return;
    }
    int m = (l + r) / 2;
    if (pos < m) {
        update(2 * v + 1, l, m, pos, val);
    } else {
        update(2 * v + 2, m, r, pos, val);
    }
    t[v] = t[2 * v + 1] + t[2 * v + 2];
}

int sum(int v, int l, int r, int askr) {
    if (l >= askr) {
        return 0;
    }
    if (r <= askr) {
        return t[v];
    }
    int m = (l + r) / 2;
    return sum(2 * v + 1, l, m, askr) + sum(2 * v + 2, m, r, askr);
}

int get_ans(int v, int l, int r, int askr, int k) {
    if (r - l == 1) {
        return l;
    }
    int m = (l + r) / 2;
    if (k <= t[2 * v + 1]) {
        return get_ans(2 * v + 1, l, m, askr, k);
    }
    return get_ans(2 * v + 2, m, r, askr, k - t[2 * v + 1]);
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    freopen("kthzero.in", "r", stdin);
    freopen("kthzero.out", "w", stdout);
    int n;
    cin >> n;
    a.resize(n);
    t.resize(4 * n);
    for (int i = 0; i < n; i++) cin >> a[i];
    build(0, 0, n);
    int q;
    cin >> q;
    char type;
    int l, r, k;
    while(q--) {
        cin >> type;
        if (type == 'u') {
            cin >> l >> k;
            update(0, 0, n, l - 1, k);
        } else {
            cin >> l >> r >> k;
//            cout << "sum: " << sum(0, 0, n, l-1) << "\n";
            k += sum(0, 0, n, l - 1);
            int mmm = sum(0, 0, n, r);
            cout << (mmm >= k ? get_ans(0, 0, n, r, k) + 1 : -1) << "\n";
        }
    }
}
/*
 5
 0 0 3 0 2
 3
 u 1 5
 u 1 0
 s 1 5 3
 -> 4
*/