#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1000000000,1000000000")
using namespace std;
const long long inf = 1e18 + 7;
const long long mod = 1e9 + 7;
const double eps = 1e-12;
const double PI = 2 * acos(0.0);
const double E = 2.71828;
int n, q, sums[300005], where[300005], num[300005];
long long t[1200000], add[1200000];
long long get(long long v, long long tl, long long tr, long long l,
              long long r);
inline void calc() {
  for (long long i = 2; i <= n; i++) {
    sums[i] = sums[i - 1] + (where[i] < where[i - 1]);
  }
}
void build(long long v, long long l, long long r) {
  if (l == r)
    t[v] = sums[l];
  else {
    long long m = (l + r) >> 1LL;
    build(v + v, l, m);
    build(v + v + 1, m + 1, r);
    t[v] = t[v + v] + t[v + v + 1];
  }
}
void modify(long long v, long long tl, long long tr, long long l, long long r,
            long long val) {
  if (l <= tl && tr <= r) {
    t[v] += (tr - tl + 1) * val;
    add[v] += val;
    return;
  }
  long long tm = (tl + tr) >> 1LL;
  if (l <= tm) modify(v + v, tl, tm, l, r, val);
  if (r > tm) modify(v + v + 1, tm + 1, tr, l, r, val);
  t[v] = t[v + v] + t[v + v + 1] + (tr - tl + 1) * add[v];
}
long long get(long long v, long long tl, long long tr, long long l,
              long long r) {
  if (l <= tl && tr <= r) {
    return t[v];
  }
  long long tm = (tl + tr) >> 1LL;
  long long res = (min(tr, r) - max(tl, l) + 1) * add[v];
  if (l <= tm) res += get(v + v, tl, tm, l, r);
  if (r > tm) res += get(v + v + 1, tm + 1, tr, l, r);
  return res;
}
void change(long long num, long long prev, long long now,
            long long p_num = -1) {
  long long res_now = 0, res_next = 0;
  if (num - 1 != p_num && prev > where[num - 1] && now <= where[num - 1])
    res_now++;
  if (num - 1 != p_num && prev < where[num - 1] && now >= where[num - 1])
    res_now--;
  if (num + 1 != p_num && prev < where[num + 1] && now >= where[num + 1])
    res_next++;
  if (num + 1 != p_num && prev > where[num + 1] && now <= where[num + 1])
    res_next--;
  modify(1, 0, n + 1, num, n, res_now);
  modify(1, 0, n + 1, num + 1, n, res_next);
}
int main(void) {
  scanf("%d", &n);
  for (long long(i) = 0; (i) < (long long)(n); (i)++) {
    int x;
    scanf("%d", &x);
    where[x] = i + 1;
    num[i + 1] = x;
  }
  where[n + 1] = n + 1;
  num[n + 1] = n + 1;
  calc();
  build(1, 0, n + 1);
  scanf("%d", &q);
  for (long long(i) = 0; (i) < (long long)(q); (i)++) {
    int type, x, y;
    scanf("%d%d%d", &type, &x, &y);
    if (type == 1) {
      printf("%d\n", get(1, 0, n + 1, y, y) - get(1, 0, n + 1, x, x) + 1);
    } else {
      long long prev1 = where[num[x]], now1 = y;
      long long prev2 = where[num[y]], now2 = x;
      change(num[x], prev1, now1);
      change(num[y], prev2, now2, num[x]);
      where[num[x]] = y;
      where[num[y]] = x;
      swap(num[x], num[y]);
    }
  }
  return 0;
}
