#include <bits/stdc++.h>
using namespace std;
const long long int maxn = (3e5) + 10, mod = 1e9 + 7;
long long int n, a[maxn], pnt[maxn], q;
struct node {
  long long int ans;
  long long int l, r;
  long long int res1, res2;
};
node seg[4 * maxn], ep;
node mer(node a, node b) {
  if (a.r == 0) return b;
  if (b.r == 0) return a;
  node ans;
  ans.ans = a.ans + b.ans;
  ans.l = a.l;
  ans.r = b.r;
  ans.res1 = a.res1;
  ans.res2 = b.res2;
  if (a.res2 < b.res1) ans.ans--;
  return ans;
}
void build(long long int s = 0, long long int e = n, long long int id = 1) {
  if (s == e - 1) {
    seg[id].ans = 1;
    seg[id].l = s;
    seg[id].r = e;
    seg[id].res1 = pnt[s];
    seg[id].res2 = pnt[s];
    return;
  }
  long long int mid = (s + e) >> 1;
  build(s, mid, 2 * id);
  build(mid, e, 2 * id + 1);
  seg[id] = mer(seg[2 * id], seg[2 * id + 1]);
}
void upd(long long int pntt, long long int val, long long int s = 0,
         long long int e = n, long long int id = 1) {
  if (s == e - 1) {
    pnt[s] = val;
    seg[id].ans = 1;
    seg[id].l = s;
    seg[id].r = e;
    seg[id].res1 = pnt[s];
    seg[id].res2 = pnt[s];
    return;
  }
  long long int mid = (s + e) >> 1;
  if (pntt < mid)
    upd(pntt, val, s, mid, 2 * id);
  else
    upd(pntt, val, mid, e, 2 * id + 1);
  seg[id] = mer(seg[2 * id], seg[2 * id + 1]);
}
node get(long long int l, long long int r, long long int s = 0,
         long long int e = n, long long int id = 1) {
  if (r <= s || e <= l) return ep;
  if (l <= s && e <= r) return seg[id];
  long long int mid = (s + e) >> 1;
  return mer(get(l, r, s, mid, 2 * id), get(l, r, mid, e, 2 * id + 1));
}
void deb(long long int s = 0, long long int e = n, long long int id = 1) {
  if (s == e - 1) {
    cout << seg[id].res1 << ' ';
    return;
  }
  long long int mid = (s + e) >> 1;
  deb(s, mid, 2 * id);
  deb(mid, e, 2 * id + 1);
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  for (long long int i = 1; i <= n; i++) {
    cin >> a[i - 1];
    pnt[a[i - 1] - 1] = i - 1;
  }
  build();
  cin >> q;
  while (q--) {
    long long int t;
    cin >> t;
    long long int l, r;
    cin >> l >> r;
    if (t == 1)
      cout << get(l - 1, r).ans << endl;
    else {
      l--;
      r--;
      long long int res1 = a[l] - 1;
      long long int res2 = a[r] - 1;
      upd(res1, r);
      upd(res2, l);
      swap(a[l], a[r]);
    }
  }
  return 0;
}
