#include <bits/stdc++.h>
using namespace std;
vector<long long> tree;
long long sz = 1;
long long sum(long long v, long long l, long long r, long long L, long long R) {
  if (r < L || l > R) return 0;
  if (l <= L && R <= r) return tree[v];
  return sum(v * 2 + 1, l, r, L, (L + R) / 2) +
         sum(v * 2 + 2, l, r, (L + R) / 2 + 1, R);
}
void upd(long long v) {
  if (v < 0) return;
  tree[v] = tree[2 * v + 1] + tree[2 * v + 2];
  if (v == 0) return;
  upd((v - 1) / 2);
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<long long> a(n + 1);
  vector<long long> pos(n + 1, -1);
  vector<bool> is(n + 1);
  for (long long i = 1; i <= n; ++i) {
    cin >> a[i];
    pos[a[i]] = i;
    if (a[i] == n || pos[a[i] + 1] != -1) {
      is[a[i]] = true;
    }
  }
  while (sz < n) sz *= 2;
  tree.resize(sz * 2 - 1);
  for (long long i = sz - 1; i < sz - 1 + n; ++i) {
    tree[i] = is[i - sz + 2];
  }
  for (long long i = sz - 2; i >= 0; --i) {
    tree[i] = tree[2 * i + 1] + tree[2 * i + 2];
  }
  long long q;
  cin >> q;
  while (q--) {
    long long t;
    cin >> t;
    if (t == 1) {
      long long l, r;
      cin >> l >> r;
      r--;
      l--;
      cout << sum(0, l, r, 0, sz - 1) + (is[r + 1] == false) << '\n';
    } else {
      long long x, y;
      cin >> x >> y;
      long long left = a[x], right = a[y];
      swap(a[x], a[y]);
      pos[left] = y;
      pos[right] = x;
      is[left] = (left == n || pos[left + 1] < y);
      tree[left + sz - 2] = is[left];
      is[right] = (right == n || pos[right + 1] < x);
      tree[right + sz - 2] = is[right];
      if (left > 1)
        is[left - 1] = pos[left - 1] > pos[left],
                  tree[left + sz - 3] = is[left - 1];
      if (right > 1)
        is[right - 1] = (pos[right - 1] > pos[right]),
                   tree[right + sz - 3] = is[right - 1];
      upd((left + sz - 3) / 2);
      upd((right + sz - 3) / 2);
      if (left > 0) upd((left + sz - 4) / 2);
      if (right > 0) upd((right + sz - 4) / 2);
    }
  }
}
