#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;
const int maxn = 200000 + 20;
int a[maxn];
int n;
int cnt[maxn], to[maxn];
int magic;
int calc(int id) {
    return (id - 1) / magic + 1;
}
void dfs(int cur, int per) {
    if (cur > n) return;
    if (cnt[cur]) return;
    int t = calc(cur + a[cur]);
    if (t != per) {
        cnt[cur] = 1;
        to[cur] = cur + a[cur];
        dfs(cur + a[cur], t);
    } else {
        dfs(cur + a[cur], per);
        if (cur + a[cur] > n) {
            cnt[cur] = 1;
            to[cur] = n + 1;
        } else {
            cnt[cur] = cnt[cur + a[cur]] + 1;
            to[cur] = to[cur + a[cur]];
        }
    }
}
int id;
int vis[maxn], DFN;
void update(int cur, int per) {
    if (cur > n) return;
    vis[cur] = DFN;
    int t = calc(a[cur] + cur);
    if (t != per) {
        cnt[cur] = 1;
        to[cur] = a[cur] + cur;
    } else {
        update(cur + a[cur], per);
        if (cur + a[cur] > n) {
            cnt[cur] = 1;
            to[cur] = n + 1;
        } else {
            cnt[cur] = cnt[cur + a[cur]] + 1;
            to[cur] = to[cur + a[cur]];
        }
    }
}
void work() {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
    }
    magic = (int)sqrt(n);
    for (int i = 1; i <= n; ++i) {
        if (!cnt[i]) {
            dfs(i, calc(i));
        }
    }
//    for (int i = 1; i <= n; ++i) {
//        printf("%d %d\n", cnt[i], to[i]);
//    }
    int m;
    scanf("%d", &m);
    while (m--) {
        int op;
        scanf("%d%d", &op, &id);
        ++id;
        if (op == 1) {
            int ans = 0;
            for (int i = id; i <= n; i = to[i]) {
                ans += cnt[i];
            }
            printf("%d\n", ans);
        } else {
            int val;
            scanf("%d", &val);
            a[id] = val;
            int t = calc(id);
            ++DFN;
//            update((t - 1) * magic + 1, t);
            for (int i = (t - 1) * magic + 1; i <= id; ++i) {
                if (vis[i] == DFN) continue;
                update(i, t);
            }
        }
    }
}

int main() {
#ifdef local
    freopen("data.txt", "r", stdin);
//    freopen("data.txt", "w", stdout);
#endif
    work();
    return 0;
}