#include <bits/stdc++.h>
using namespace std;
const int MAXN = 101;
int read(int idx, int* tree) {
  int sum = 0;
  while (idx > 0) {
    sum += tree[idx];
    idx -= (idx & -idx);
  }
  return sum;
}
void update(int idx, int val, int* tree, int n) {
  while (idx <= n) {
    tree[idx] += val;
    idx += (idx & -idx);
  }
}
int queryGet(int x, int y, int* tree, bool* flags) {
  return read(y, tree) - read(x - 1, tree) + ((flags[y]) ? 0 : 1);
}
void queryUpd(int a, int b, int* tree, int* btop, int* ptob, bool* flags,
              int n) {
  a = ptob[a];
  b = ptob[b];
  if (a > b) {
    int tmp = a;
    a = b;
    b = tmp;
  }
  int newap = btop[b];
  int oldap = btop[a];
  int newbp = btop[a];
  int oldbp = btop[b];
  btop[a] = newap;
  btop[b] = newbp;
  ptob[newap] = a;
  ptob[newbp] = b;
  if (flags[a] && newap < oldap && a < n && btop[a + 1] > newap) {
    flags[a] = false;
    update(a, -1, tree, n);
  }
  if (flags[b] && newbp < oldbp && b < n && btop[b + 1] > newbp) {
    flags[b] = false;
    update(b, -1, tree, n);
  }
  if (!flags[a] && newap > oldap && a < n && btop[a + 1] < newap) {
    flags[a] = true;
    update(a, 1, tree, n);
  }
  if (!flags[b] && newbp > oldbp && b < n && btop[b + 1] < newbp) {
    flags[b] = true;
    update(b, 1, tree, n);
  }
  if (newap < oldap && btop[a - 1] > newap && btop[a - 1] < oldap) {
    flags[a - 1] = true;
    update(a - 1, 1, tree, n);
  }
  if (oldap < newap && btop[a - 1] < newap && btop[a - 1] > oldap) {
    flags[a - 1] = false;
    update(a - 1, -1, tree, n);
  }
  if (b != a + 1) {
    if (newbp < oldbp && btop[b - 1] > newbp && btop[b - 1] < oldbp) {
      flags[b - 1] = true;
      update(b - 1, 1, tree, n);
    }
    if (oldbp < newbp && btop[b - 1] < newbp && btop[b - 1] > oldbp) {
      flags[b - 1] = false;
      update(b - 1, -1, tree, n);
    }
  }
}
int main() {
  bool flags[MAXN] = {};
  int btop[MAXN];
  int ptob[MAXN];
  int tree[MAXN] = {};
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int tmp;
    cin >> tmp;
    flags[tmp] = true;
    flags[tmp - 1] = false;
    btop[tmp] = i + 1;
    ptob[i + 1] = tmp;
  }
  for (int i = 1; i <= n; i++) {
    if (flags[i]) update(i, 1, tree, n);
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int qtype, qa, qb;
    cin >> qtype >> qa >> qb;
    if (qtype == 1)
      cout << queryGet(qa, qb, tree, flags) << endl;
    else if (qtype == 2) {
      queryUpd(qa, qb, tree, btop, ptob, flags, n);
    }
  }
}
