#include <bits/stdc++.h>
using namespace std;
template <typename T>
T nextInt() {
  T x = 0, p = 1;
  char ch;
  do {
    ch = getchar();
  } while (ch <= ' ');
  if (ch == '-') {
    p = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + (ch - '0');
    ch = getchar();
  }
  return x * p;
}
const int maxN = (int)3e5 + 10;
const int maxK = 17;
const int INF = (int)1e9;
const int mod = (int)1e9 + 7;
const long long LLINF = (long long)1e18;
int n, q;
int a[maxN];
int p[maxN];
template <typename T>
T myFunction(T a, T b) {
  return a + b;
}
template <class T>
struct segmentTree {
  int n;
  T *t;
  segmentTree(int n) : n(n) {
    t = new T[4 * n];
    fill(t, t + 4 * n, 0);
    build(1, 0, n - 1);
  }
  void build(int v, int l, int r) {
    if (l == r) {
      t[v] = 0;
    } else {
      int m = (l + r) / 2;
      build(v + v, l, m);
      build(v + v + 1, m + 1, r);
      t[v] = t[v + v] + t[v + 1 + v] + (p[m] > p[m + 1]);
    }
  }
  T get(int l, int r) { return get(1, l, r, 0, n - 1); }
  T get(int v, int l, int r, int tl, int tr) {
    if (tl >= l && tr <= r) {
      return t[v];
    }
    int tm = (tl + tr) / 2;
    if (l > tm) {
      return get(v + v + 1, l, r, tm + 1, tr);
    }
    if (r <= tm) {
      return get(v + v, l, r, tl, tm);
    }
    return myFunction(get(v + v, l, r, tl, tm),
                      get(v + v + 1, l, r, tm + 1, tr)) +
           (p[tm] > p[tm + 1]);
  }
  void modifyElement(int pos) { modifyElement(1, pos, 0, n - 1); }
  void modifyElement(int v, int pos, int tl, int tr) {
    if (tl == tr) {
      return;
    }
    int tm = (tl + tr) / 2;
    if (pos <= tm) {
      modifyElement(v + v, pos, tl, tm);
    } else {
      modifyElement(v + v + 1, pos, tm + 1, tr);
    }
    t[v] = myFunction(t[v + v], t[v + v + 1]) + (p[tm] > p[tm + 1]);
  }
};
int main() {
  n = nextInt<int>();
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    a[i]--;
    p[a[i]] = i;
  }
  segmentTree<int> t(n);
  q = nextInt<int>();
  while (q--) {
    int type, l, r;
    type = nextInt<int>();
    l = nextInt<int>() - 1;
    r = nextInt<int>() - 1;
    if (type == 1) {
      printf("%d\n", t.get(l, r) + 1);
    } else {
      swap(a[l], a[r]);
      swap(p[a[l]], p[a[r]]);
      t.modifyElement(a[l]);
      t.modifyElement(a[r]);
    }
  }
  return 0;
}
