#include <bits/stdc++.h>
class SegTree {
  std::vector<int> tree;
  int sz;

 public:
  SegTree(const std::vector<bool>& init) {
    int n = init.size();
    sz = 1;
    while (sz < n) {
      sz <<= 1;
    }
    tree.assign(2 * sz - 1, 0);
    for (int j = 0; j < n; ++j) {
      tree[j + sz - 1] = init[j];
    }
    for (int i = sz - 2; i >= 0; --i) {
      tree[i] = tree[2 * i + 1] + tree[2 * i + 2];
    }
  }
  int get_sum(int left, int right, int x = 0, int l = 0, int r = -1) const {
    if (r == -1) {
      r = sz;
    }
    if (l == left && right == r) {
      return tree[x];
    }
    int mid = (l + r) / 2, ans = 0;
    if (left < mid) {
      ans += get_sum(left, std::min(right, mid), 2 * x + 1, l, mid);
    }
    if (right > mid) {
      ans += get_sum(std::max(left, mid), right, 2 * x + 2, mid, r);
    }
    return ans;
  }
  void update(int idx, int val, int x = 0, int l = 0, int r = -1) {
    if (r == -1) {
      r = sz;
    }
    if (l + 1 == r) {
      tree[x] = val;
      return;
    }
    int mid = (l + r) / 2;
    if (idx < mid) {
      update(idx, val, 2 * x + 1, l, mid);
    } else {
      update(idx, val, 2 * x + 2, mid, r);
    }
    tree[x] = tree[2 * x + 1] + tree[2 * x + 2];
  }
};
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout.tie(nullptr);
  int n, q, type, x, y;
  std::cin >> n;
  std::vector<int> p(n), a(n);
  for (int i = 0; i < n; ++i) {
    std::cin >> a[i];
    p[--a[i]] = i;
  }
  std::vector<bool> is_bad(n);
  for (int i = 0; i < n - 1; ++i) {
    is_bad[i] = (p[i] > p[i + 1]);
  }
  SegTree tree(is_bad);
  std::cin >> q;
  while (q--) {
    std::cin >> type >> x >> y;
    --x, --y;
    if (type == 1) {
      std::cout << 1 + tree.get_sum(x, y) << '\n';
    } else {
      int u = a[x], v = a[y];
      std::swap(a[x], a[y]);
      std::swap(p[u], p[v]);
      tree.update(u, p[u + 1] < p[u]);
      tree.update(v - 1, p[v] < p[v - 1]);
      if (u) {
        tree.update(u - 1, p[u] < p[u - 1]);
      }
      if (v < n - 1) {
        tree.update(v, p[v + 1] < p[v]);
      }
    }
  }
  return 0;
}
