#include <bits/stdc++.h>
using namespace std;
template <int n>
class SegmentTree {
  int *v;
  template <int p, int sl, int sr, int maxDepth>
  struct SumQuery {
    inline static int eval(const SegmentTree *st, int l, int r) {
      if (sl == l && sr == r) return st->v[p];
      const int sm = (sl + sr) >> 1;
      if (l <= sm) {
        if (r <= sm)
          return SumQuery<(p << 1) + 1, sl, sm, maxDepth - 1>::eval(st, l, r);
        return LeftSumQuery<(p << 1) + 1, sl, sm, maxDepth - 1>::eval(st, l) +
               RightSumQuery<(p + 1) << 1, sm + 1, sr, maxDepth - 1>::eval(st,
                                                                           r);
      }
      return SumQuery<(p + 1) << 1, sm + 1, sr, maxDepth - 1>::eval(st, l, r);
    }
  };
  template <int p, int sl, int sr>
  struct SumQuery<p, sl, sr, 0> {
    inline static int eval(const SegmentTree *st, int l, int r) {
      return st->sum(p, sl, sr, l, r);
    }
  };
  template <int p, int sl, int sr, int maxDepth>
  struct LeftSumQuery {
    inline static int eval(const SegmentTree *st, int l) {
      if (sl == l) return st->v[p];
      const int sm = (sl + sr) >> 1;
      if (l <= sm)
        return st->v[(p + 1) << 1] +
               LeftSumQuery<(p << 1) + 1, sl, sm, maxDepth - 1>::eval(st, l);
      return LeftSumQuery<(p + 1) << 1, sm + 1, sr, maxDepth - 1>::eval(st, l);
    }
  };
  template <int p, int sl, int sr>
  struct LeftSumQuery<p, sl, sr, 0> {
    inline static int eval(const SegmentTree *st, int l) {
      return st->leftSum(p, sl, sr, l);
    }
  };
  template <int p, int sl, int sr, int maxDepth>
  struct RightSumQuery {
    inline static int eval(const SegmentTree *st, int r) {
      if (sr == r) return st->v[p];
      const int sm = (sl + sr) >> 1;
      if (sm < r)
        return st->v[(p << 1) + 1] +
               RightSumQuery<(p + 1) << 1, sm + 1, sr, maxDepth - 1>::eval(st,
                                                                           r);
      return RightSumQuery<(p << 1) + 1, sl, sm, maxDepth - 1>::eval(st, r);
    }
  };
  template <int p, int sl, int sr>
  struct RightSumQuery<p, sl, sr, 0> {
    inline static int eval(const SegmentTree *st, int r) {
      return st->rightSum(p, sl, sr, r);
    }
  };
  void set(const int p, const int sl, const int sr, const int idx,
           const int val) {
    if (sl == sr) {
      v[p] = val;
      return;
    }
    const int sm = (sl + sr) >> 1;
    if (idx <= sm)
      set((p << 1) + 1, sl, sm, idx, val);
    else
      set((p + 1) << 1, sm + 1, sr, idx, val);
    v[p] = v[(p << 1) + 1] + v[(p + 1) << 1];
  }
  int sum(const int p, const int sl, const int sr, const int l,
          const int r) const {
    if (sl == l && sr == r) return v[p];
    const int sm = (sl + sr) >> 1;
    if (l <= sm) {
      if (r <= sm) return sum((p << 1) + 1, sl, sm, l, r);
      return leftSum((p << 1) + 1, sl, sm, l) +
             rightSum((p + 1) << 1, sm + 1, sr, r);
    }
    return sum((p + 1) << 1, sm + 1, sr, l, r);
  }
  int leftSum(const int p, const int sl, const int sr, const int l) const {
    if (sl == l) return v[p];
    const int sm = (sl + sr) >> 1;
    if (l <= sm) return v[(p + 1) << 1] + leftSum((p << 1) + 1, sl, sm, l);
    return leftSum((p + 1) << 1, sm + 1, sr, l);
  }
  int rightSum(const int p, const int sl, const int sr, const int r) const {
    if (sr == r) return v[p];
    const int sm = (sl + sr) >> 1;
    if (sm < r) return v[(p << 1) + 1] + rightSum((p + 1) << 1, sm + 1, sr, r);
    return rightSum((p << 1) + 1, sl, sm, r);
  }

 public:
  SegmentTree() : v(new int[n << 2]) { fill(v, v + (n << 2), 0); }
  void set(const int idx, const int val) { set(0, 0, n - 1, idx, val); }
  int sum(const int l, const int r) {
    return SumQuery<0, 0, n - 1, 10>::eval(this, l, r);
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<int> vv(n);
  vector<int> v(n);
  for (int i = 0; i < n; ++i) {
    cin >> vv[i];
    v[--vv[i]] = i;
  }
  SegmentTree<300000> st;
  for (int i = 1; i < n; ++i) {
    if (v[i] < v[i - 1]) st.set(i - 1, 1);
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; ++i) {
    int p, x, y;
    cin >> p >> x >> y;
    --x;
    --y;
    if (p == 1) {
      cout << st.sum(x, y) - st.sum(y, y) + 1 << '\n';
    } else {
      swap(vv[x], vv[y]);
      x = vv[x];
      y = vv[y];
      if (x != 0 && v[x] < v[x - 1]) st.set(x - 1, 0);
      if (y != 0 && v[y] < v[y - 1]) st.set(y - 1, 0);
      if (x != n - 1 && v[x + 1] < v[x]) st.set(x, 0);
      if (y != n - 1 && v[y + 1] < v[y]) st.set(y, 0);
      swap(v[x], v[y]);
      if (x != 0 && v[x] < v[x - 1]) st.set(x - 1, 1);
      if (y != 0 && v[y] < v[y - 1]) st.set(y - 1, 1);
      if (x != n - 1 && v[x + 1] < v[x]) st.set(x, 1);
      if (y != n - 1 && v[y + 1] < v[y]) st.set(y, 1);
    }
  }
}
