#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const long long inf = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1.0);
int a[300005];
int du[300005];
map<int, int> mp;
struct node {
  int l, r;
  int data;
  void _node(int ll, int rr, int dd) {
    l = ll;
    r = rr;
    data = dd;
  }
} tr[300005 * 4];
void build(int l, int r, int pos) {
  int mid = (l + r) / 2;
  tr[pos]._node(l, r, 0);
  if (l == r) return;
  build(l, mid, 2 * pos);
  build(mid + 1, r, 2 * pos + 1);
}
void update(int num, int pos, int del) {
  if (num >= tr[pos].l && num <= tr[pos].r) tr[pos].data += del;
  if (tr[pos].l == tr[pos].r) return;
  int l = tr[pos].l, r = tr[pos].r;
  int mid = (l + r) / 2;
  if (num <= mid)
    update(num, pos * 2, del);
  else
    update(num, pos * 2 + 1, del);
}
int read(int l, int r, int pos) {
  if (tr[pos].l == tr[pos].r || tr[pos].l == l && tr[pos].r == r)
    return tr[pos].data;
  int mid = (tr[pos].l + tr[pos].r) / 2;
  if (l > mid) {
    return read(l, r, pos * 2 + 1);
  } else if (r <= mid) {
    return read(l, r, pos * 2);
  } else {
    return read(l, mid, pos * 2) + read(mid + 1, r, pos * 2 + 1);
  }
}
int main() {
  int n;
  scanf("%d", &n);
  build(1, n, 1);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    mp[a[i]] = i;
  }
  update(1, 1, 1);
  for (int i = 2; i <= n; i++) {
    if (mp[i] >= mp[i - 1])
      du[i] = 1;
    else
      update(i, 1, 1);
  }
  int qnum;
  int pi = 0;
  scanf("%d", &qnum);
  for (int q = 1; q <= qnum; q++) {
    int o, l, r;
    scanf("%d%d%d", &o, &l, &r);
    if (l > r) swap(l, r);
    bool cf = false;
    if (r == l - 1) cf = true;
    if (o == 2) {
      int lsl = mp[a[l]], lsr = mp[a[r]];
      swap(a[l], a[r]);
      swap(mp[a[l]], mp[a[r]]);
      int mi = a[l], ma = a[r];
      if (mi > ma) swap(mi, ma);
      if (mi - 1 >= 1 && du[mi] == 0 && mp[mi - 1] < mp[mi]) {
        du[mi] = 1;
        update(mi, 1, -1);
      } else if (mi - 1 >= 1 && du[mi] && mp[mi] < mp[mi - 1]) {
        du[mi] = 0;
        update(mi, 1, 1);
      }
      if (mi + 1 <= n && du[mi + 1] == 0 && mp[mi] < mp[mi + 1]) {
        du[mi + 1] = 1;
        update(mi + 1, 1, -1);
      } else if (mi + 1 <= n && du[mi + 1] && mp[mi + 1] < mp[mi]) {
        du[mi + 1] = 0;
        update(mi + 1, 1, 1);
      }
      if (!cf && ma - 1 >= 1 && du[ma] == 0 && mp[ma - 1] < mp[ma]) {
        du[ma] = 1;
        update(ma, 1, -1);
      } else if (!cf && ma - 1 >= 1 && du[ma] && mp[ma] < mp[ma - 1]) {
        du[ma] = 0;
        update(ma, 1, 1);
      }
      if (ma + 1 <= n && du[ma + 1] == 0 && mp[ma] < mp[ma + 1]) {
        du[ma + 1] = 1;
        update(ma + 1, 1, -1);
      } else if (ma + 1 <= n && du[ma + 1] && mp[ma + 1] < mp[ma]) {
        du[ma + 1] = 0;
        update(ma + 1, 1, 1);
      }
    } else {
      pi++;
      int ans = read(l, r, 1);
      if (du[l] != 0) ans++;
      printf("%d\n", ans);
    }
  }
  return 0;
}
