#include <bits/stdc++.h>
using namespace std;
const int maxx = 1200010;
const double pi = acos(-1.0);
const double eps = 1e-15;
int t, n, m, op, x, y;
int ans = 0, total = 0, sum = 0, cnt = 0;
int a[maxx], b[maxx], bj[maxx];
struct node {
  int l, r, val;
} tr[maxx];
void pushup(int p) { tr[p].val = tr[p << 1].val + tr[p << 1 | 1].val; }
void build(int p, int l, int r) {
  tr[p].l = l, tr[p].r = r;
  if (l == r) {
    tr[p].val = a[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(p << 1, l, mid);
  build(p << 1 | 1, mid + 1, r);
  pushup(p);
  return;
}
void update(int p, int c, int z) {
  int l = tr[p].l, r = tr[p].r;
  if (l == r && l == c) {
    tr[p].val = z;
    return;
  }
  int mid = (l + r) >> 1;
  if (c <= mid)
    update(p << 1, c, z);
  else
    update(p << 1 | 1, c, z);
  pushup(p);
  return;
}
int query(int p, int L, int R) {
  int l = tr[p].l, r = tr[p].r;
  if (L <= l && R >= r) return tr[p].val;
  int res = 0, mid = (l + r) >> 1;
  if (L <= mid) res += query(p << 1, L, R);
  if (R > mid) res += query(p << 1 | 1, L, R);
  return res;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &b[i]), bj[b[i]] = i;
  for (int i = 1; i <= n; i++)
    if (bj[b[i] + 1] > i) a[b[i]] = 1;
  build(1, 1, n);
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d%d", &op, &x, &y);
    if (op == 1) {
      if (x != y)
        ans = y - x + 1 - query(1, x, y - 1);
      else
        ans = 1;
      printf("%d\n", ans);
    } else {
      swap(bj[b[x]], bj[b[y]]), swap(b[x], b[y]);
      if (bj[b[x] + 1] > bj[b[x]])
        update(1, b[x], 1);
      else
        update(1, b[x], 0);
      if (bj[b[y] + 1] > bj[b[y]])
        update(1, b[y], 1);
      else
        update(1, b[y], 0);
      if (b[x] - 1 != 0) {
        if (bj[b[x]] > bj[b[x] - 1])
          update(1, b[x] - 1, 1);
        else
          update(1, b[x] - 1, 0);
      }
      if (b[y] - 1 != 0) {
        if (bj[b[y]] > bj[b[y] - 1])
          update(1, b[y] - 1, 1);
        else
          update(1, b[y] - 1, 0);
      }
    }
  }
  return 0;
}
