#include <bits/stdc++.h>
using namespace std;
template <typename T>
T mabs(const T &a) {
  return a < 0 ? -a : a;
}
const int SZ = 300300;
int End[SZ], Beg[SZ];
void addFen(int pos, int val, int *Fen) {
  for (int i = pos; i < SZ; i += i & -i) Fen[i] += val;
}
int getFen(int pos, int *Fen) {
  int res = 0;
  for (int i = pos; i > 0; i -= i & -i) res += Fen[i];
  return res;
}
int getAB(int a, int b, int *Fen) {
  int res = getFen(b, Fen);
  if (a > 1) res -= getFen(a - 1, Fen);
  return res;
}
map<int, int> mp;
int n;
int A[SZ];
void check(int i) {
  if (i == n || mp[i + 1] < mp[i]) addFen(i, 1, End);
  if (i == 1 || mp[i - 1] > mp[i]) addFen(i, 1, Beg);
}
void uncheck(int i) {
  if (getAB(i, i, Beg)) addFen(i, -1, Beg);
  if (getAB(i, i, End)) addFen(i, -1, End);
}
void proc(int a, int b) {
  int valB = A[b];
  int valA = A[a];
  swap(A[a], A[b]);
  mp[valA] = b;
  mp[valB] = a;
  vector<int> v;
  v.push_back(valA);
  v.push_back(valB);
  for (int i = (0), ei = (2); i < ei; i++)
    for (int j = -1; j <= 1; j += 2)
      if (v[i] + j >= 1 && v[i] + j <= n) v.push_back(v[i] + j);
  sort((v).begin(), (v).end());
  v.resize(unique((v).begin(), (v).end()) - v.begin());
  for (int i = (0), ei = (v.size()); i < ei; i++) uncheck(v[i]);
  for (int i = (0), ei = (v.size()); i < ei; i++) check(v[i]);
}
void show(int n) {
  puts("");
  for (int i = (1), ei = (n + 1); i < ei; i++) printf("%d ", getAB(i, i, Beg));
  puts("");
  for (int i = (1), ei = (n + 1); i < ei; i++) printf("%d ", getAB(i, i, End));
}
void run() {
  cin >> n;
  for (int i = (0), ei = (n); i < ei; i++) {
    scanf("%d", A + i);
    mp[A[i]] = i;
  }
  for (int i = (1), ei = (n + 1); i < ei; i++) {
    check(i);
  }
  int q;
  cin >> q;
  for (int i = (0), ei = (q); i < ei; i++) {
    int t, a, b;
    scanf("%d%d%d", &t, &a, &b);
    if (t == 1) {
      int res = getAB(a, b, End);
      if (a != n && mp[b + 1] > mp[b]) res++;
      printf("%d\n", res);
    } else {
      --a;
      --b;
      proc(a, b);
    }
  }
}
int main() {
  run();
  return 0;
}
