#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int s = 0;
  bool f = 0;
  char ch = ' ';
  while (!isdigit(ch)) {
    f |= (ch == '-');
    ch = getchar();
  }
  while (isdigit(ch)) {
    s = (s << 3) + (s << 1) + (ch ^ 48);
    ch = getchar();
  }
  return (f) ? (-s) : (s);
}
inline void write(int x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  if (x < 10) {
    putchar(x + '0');
    return;
  }
  write(x / 10);
  putchar((x % 10) + '0');
}
const int N = 300005;
int n, Q, a[N], pos[N];
struct Node {
  int sum;
} T[N << 2];
inline Node merg(Node p, Node q) {
  Node ans;
  ans.sum = p.sum + q.sum;
  return ans;
}
inline void chag(int x, int l, int r, int pos, int val) {
  if (l == r) {
    T[x].sum = val;
    return;
  }
  int mid = (l + r) >> 1;
  if (pos <= mid)
    chag((x << 1), l, mid, pos, val);
  else
    chag((x << 1 | 1), mid + 1, r, pos, val);
  T[x] = merg(T[(x << 1)], T[(x << 1 | 1)]);
}
inline Node que(int x, int l, int r, int ql, int qr) {
  if (l == ql && r == qr) return T[x];
  int mid = (l + r) >> 1;
  if (qr <= mid)
    return que((x << 1), l, mid, ql, qr);
  else if (ql > mid)
    return que((x << 1 | 1), mid + 1, r, ql, qr);
  else
    return merg(que((x << 1), l, mid, ql, mid),
                que((x << 1 | 1), mid + 1, r, mid + 1, qr));
  T[x] = merg(T[(x << 1)], T[(x << 1 | 1)]);
}
int main() {
  int i, opt, x, y;
  n = read();
  for (i = 1; i <= n; i++) pos[a[i] = read()] = i;
  for (i = 1; i < n; i++)
    if (pos[i] > pos[i + 1]) chag(1, 1, n, i, 1);
  Q = read();
  while (Q--) {
    opt = read();
    x = read();
    y = read();
    if (opt == 1) {
      if (x == y)
        write(1), putchar('\n');
      else
        write(que(1, 1, n, x, y - 1).sum + 1), putchar('\n');
    } else {
      int xx = a[x], yy = a[y];
      swap(pos[a[x]], pos[a[y]]);
      swap(a[x], a[y]);
      if (xx != n && pos[xx] > pos[xx + 1]) chag(1, 1, n, xx, 1);
      if (xx != n && pos[xx] < pos[xx + 1]) chag(1, 1, n, xx, 0);
      if (xx != 1 && pos[xx - 1] > pos[xx]) chag(1, 1, n, xx - 1, 1);
      if (xx != 1 && pos[xx - 1] < pos[xx]) chag(1, 1, n, xx - 1, 0);
      if (yy != n && pos[yy] > pos[yy + 1]) chag(1, 1, n, yy, 1);
      if (yy != n && pos[yy] < pos[yy + 1]) chag(1, 1, n, yy, 0);
      if (yy != 1 && pos[yy - 1] > pos[yy]) chag(1, 1, n, yy - 1, 1);
      if (yy != 1 && pos[yy - 1] < pos[yy]) chag(1, 1, n, yy - 1, 0);
    }
  }
  return 0;
}
