// Author:  HolyK
// Created: Thu Jul  8 20:33:54 2021
#include <bits/stdc++.h>
#define dbg(a...) fprintf(stderr, a)
template <class T, class U>
inline bool smin(T &x, const U &y) {
  return y < x ? x = y, 1 : 0;
}
template <class T, class U>
inline bool smax(T &x, const U &y) {
  return x < y ? x = y, 1 : 0;
}

using LL = long long;
using PII = std::pair<int, int>;

struct FenwickTree {
  std::vector<int> c;
  FenwickTree(int n) : c(n) {}
  void add(int p, int x) {
    assert(p);
    for (; p < c.size(); p += p & -p) c[p] += x;
  }
  int ask(int p) {
    int r = 0;
    for (; p; p -= p & -p) r += c[p];
    return r;
  }
  int find(int k) {
    if (!k) return 1;
    int p = 0;
    for (int i = 1 << 16; i; i >>= 1) {
      if (p + i < c.size() && k > c[p + i] + i) {
	p += i, k -= c[p] + i;
      }
    }
    return p + 1;
  }
};
constexpr int T(400);
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int n;
  std::cin >> n;
  std::vector<int> a(n), b(n);
  for (int i = 0; i < n; i++) {
    std::cin >> b[i];
    b[i] = i - b[i] + 1;
  }
  
  int tot = (n - 1) / T + 1;
  std::vector<FenwickTree> t(tot, n + 1);
  for (int i = 0, x = 0; i < tot; i++, x += T) {
    int y = std::min(x + T, n);
    for (int j = x; j < y; j++) {
      a[j] = t[i].find(b[j]);
      // std::cout << j << " " << a[j] << "\n";
      t[i].add(a[j], 1);
    }
  }
  int q;
  std::cin >> q;
  while (q--) {
    int opt, i;
    std::cin >> opt >> i;
    i--;
    int bi = i / T, y = std::min(n, bi * T + T);
    if (opt == 1) {
      for (int j = y - 1; j >= i; j--) t[bi].add(a[j], -1);
      std::cin >> b[i];
      b[i] = i - b[i] + 1;
      for (int j = i; j < y; j++) {
	a[j] = t[bi].find(b[j]);
	t[bi].add(a[j], 1);
      }
    } else {
      int ans = b[i];
      for (int j = i + 1; j < y; j++) if (b[j] <= ans) ans++;
      for (int j = bi + 1; j < tot; j++) {
	assert(ans <= n);
	ans += t[j].ask(ans);
      }
      std::cout << ans << "\n";
    }
  }
  return 0;
}
/*
3
0 0 0
7
2 1
2 2
2 3
1 2 1
2 1
2 2
2 3

5
0 1 2 3 4
15
2 1
2 2
1 2 1
2 2
2 3
2 5
1 3 0
1 4 0
2 3
2 4
2 5
1 4 1
2 3
2 4
2 5

 */
