#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:32505856")
template <class T>
inline T sqr(T a) {
  return a * a;
}
template <class T>
inline void gmin(T &a, T b) {
  if (a > b) a = b;
}
template <class T>
inline void gmax(T &a, T b) {
  if (a < b) a = b;
}
inline int sign(const double &a) { return a > 1e-9 ? 1 : (a < -1e-9 ? -1 : 0); }
int n, q;
int a[300030], pos[300030];
map<int, int> t;
int h[1048576], P, Q, V;
void select(int first, int l, int r) {
  if (l == r) {
    V = h[first];
    return;
  }
  int m = l + r >> 1;
  if (h[first]) h[first << 1] = h[first << 1 | 1] = h[first];
  if (P <= m)
    select(first << 1, l, m);
  else
    select(first << 1 | 1, m + 1, r);
}
void insert(int first, int l, int r) {
  if (P <= l && r <= Q) {
    h[first] = V;
    return;
  }
  int m = l + r >> 1;
  if (h[first]) h[first << 1] = h[first << 1 | 1] = h[first];
  if (m >= P && Q >= l) insert(first << 1, l, m);
  if (r >= P && Q > m) insert(first << 1 | 1, m + 1, r);
  if (h[first << 1] != h[first << 1 | 1])
    h[first] = 0;
  else
    h[first] = h[first << 1];
}
int head(int first) {
  if (first < 1 || first > n) return 0;
  P = first;
  select(1, 1, n);
  return V;
}
void change_head(int l, int r, int first) {
  P = l, Q = r, V = first;
  insert(1, 1, n);
}
void catch_out(int first) {
  if (head(first) == first) {
    if (t[first] == first) return;
    if (first < n && t[head(first)] != first) {
      t[first + 1] = t[first];
      change_head(first + 1, t[first], first + 1);
    }
    t[first] = first;
    return;
  }
  if (first < n && t[head(first)] != first) {
    t[first + 1] = t[head(first)];
    change_head(first + 1, t[head(first)], first + 1);
  }
  if (first > 1) t[head(first)] = first - 1;
  t[first] = first;
  change_head(first, first, first);
}
void put_in(int first) {
  if (first > 1 && pos[first - 1] < pos[first]) {
    t[head(first - 1)] = first;
    t.erase(first);
    change_head(first, first, head(first - 1));
  }
  if (first < n && pos[first] < pos[first + 1]) {
    t[head(first)] = t[first + 1];
    t.erase(first + 1);
    change_head(first + 1, t[head(first)], head(first));
  }
}
void watch() {
  cout << endl;
  for (__typeof(t.begin()) it = t.begin(); it != t.end(); it++) {
    cout << "[" << it->first << "," << it->second << "]" << endl;
  }
  cout << endl;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    pos[a[i]] = i;
    if (head(a[i] - 1)) {
      t[head(a[i] - 1)] = a[i];
      change_head(a[i], a[i], head(a[i] - 1));
    } else {
      change_head(a[i], a[i], a[i]);
      t[a[i]] = a[i];
    }
  }
  cin >> q;
  while (q--) {
    int ord, first, second;
    cin >> ord >> first >> second;
    if (ord == 1) {
      int u = -1, v = 0;
      for (__typeof(t.begin()) it = t.begin(); it != t.end(); it++) {
        v++;
        if (u < 0 && it->first <= first && first <= it->second) u = v;
        if (it->first <= second && second <= it->second) break;
      }
      cout << (v - u + 1) << endl;
    } else {
      swap(pos[a[first]], pos[a[second]]);
      swap(a[first], a[second]);
      catch_out(a[first]);
      catch_out(a[second]);
      put_in(a[first]);
      put_in(a[second]);
    }
  }
  return 0;
}
