#include <bits/stdc++.h>
using namespace std;
const int maxn = 3 * (int)1e5 + 100;
const int BN = 30;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1000000007;
const double eps = 1e-8;
const double PI = acos(-1);
int trees[maxn];
int num[maxn];
int pos[maxn];
bool mark[maxn];
int n;
int lowbit(int x) { return x & (-x); }
void add(int pos, int num) {
  while (pos <= n) {
    trees[pos] += num;
    pos += lowbit(pos);
  }
}
int getsum(int end) {
  int sum = 0;
  while (end > 0) {
    sum += trees[end];
    end -= lowbit(end);
  }
  return sum;
}
int query(int l, int r) { return getsum(r) - getsum(l) + 1; }
void updates(int x) {
  if (mark[x] && pos[x] > pos[x - 1]) {
    add(x, -1);
    mark[x] = 0;
  }
  if (!mark[x] && pos[x] < pos[x - 1]) {
    add(x, 1);
    mark[x] = 1;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &num[i]);
    pos[num[i]] = i;
  }
  for (int i = 2; i <= n; i++)
    if (pos[i] < pos[i - 1]) mark[i] = 1;
  for (int i = 2; i <= n; i++)
    if (mark[i]) add(i, 1);
  int q;
  scanf("%d", &q);
  while (q--) {
    int op, x, y;
    scanf("%d%d%d", &op, &x, &y);
    if (op == 1)
      printf("%d\n", query(x, y));
    else {
      swap(num[x], num[y]);
      swap(pos[num[x]], pos[num[y]]);
      int t1 = num[x], t2 = num[y];
      updates(t1), updates(t2);
      if (t1 < n) updates(t1 + 1);
      if (t2 < n) updates(t2 + 1);
    }
  }
}

### Prompt

Develop a solution in cpp to the problem described below:

The Smart Beaver has recently designed and built an innovative nanotechnologic all-purpose beaver mass shaving machine, "Beavershave 5000". Beavershave 5000 can shave beavers by families! How does it work? Very easily!

There are n beavers, each of them has a unique id from 1 to n. Consider a permutation a1, a2, ..., an of n these beavers. Beavershave 5000 needs one session to shave beavers with ids from x to y (inclusive) if and only if there are such indices i1 < i2 < ... < ik, that ai1 = x, ai2 = x + 1, ..., aik - 1 = y - 1, aik = y. And that is really convenient. For example, it needs one session to shave a permutation of beavers 1, 2, 3, ..., n.

If we can't shave beavers from x to y in one session, then we can split these beavers into groups [x, p1], [p1 + 1, p2], ..., [pm + 1, y] (x ≤ p1 < p2 < ... < pm < y), in such a way that the machine can shave beavers in each group in one session. But then Beavershave 5000 needs m + 1 working sessions to shave beavers from x to y.

All beavers are restless and they keep trying to swap. So if we consider the problem more formally, we can consider queries of two types: 

  * what is the minimum number of sessions that Beavershave 5000 needs to shave beavers with ids from x to y, inclusive? 
  * two beavers on positions x and y (the beavers ax and ay) swapped. 



You can assume that any beaver can be shaved any number of times.

Input

The first line contains integer n — the total number of beavers, 2 ≤ n. The second line contains n space-separated integers — the initial beaver permutation.

The third line contains integer q — the number of queries, 1 ≤ q ≤ 105. The next q lines contain the queries. Each query i looks as pi xi yi, where pi is the query type (1 is to shave beavers from xi to yi, inclusive, 2 is to swap beavers on positions xi and yi). All queries meet the condition: 1 ≤ xi < yi ≤ n.

  * to get 30 points, you need to solve the problem with constraints: n ≤ 100 (subproblem B1); 
  * to get 100 points, you need to solve the problem with constraints: n ≤ 3·105 (subproblems B1+B2). 



Note that the number of queries q is limited 1 ≤ q ≤ 105 in both subproblem B1 and subproblem B2.

Output

For each query with pi = 1, print the minimum number of Beavershave 5000 sessions.

Examples

Input

5
1 3 4 2 5
6
1 1 5
1 3 4
2 2 3
1 1 5
2 1 5
1 1 5


Output

2
1
3
5

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3 * (int)1e5 + 100;
const int BN = 30;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1000000007;
const double eps = 1e-8;
const double PI = acos(-1);
int trees[maxn];
int num[maxn];
int pos[maxn];
bool mark[maxn];
int n;
int lowbit(int x) { return x & (-x); }
void add(int pos, int num) {
  while (pos <= n) {
    trees[pos] += num;
    pos += lowbit(pos);
  }
}
int getsum(int end) {
  int sum = 0;
  while (end > 0) {
    sum += trees[end];
    end -= lowbit(end);
  }
  return sum;
}
int query(int l, int r) { return getsum(r) - getsum(l) + 1; }
void updates(int x) {
  if (mark[x] && pos[x] > pos[x - 1]) {
    add(x, -1);
    mark[x] = 0;
  }
  if (!mark[x] && pos[x] < pos[x - 1]) {
    add(x, 1);
    mark[x] = 1;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &num[i]);
    pos[num[i]] = i;
  }
  for (int i = 2; i <= n; i++)
    if (pos[i] < pos[i - 1]) mark[i] = 1;
  for (int i = 2; i <= n; i++)
    if (mark[i]) add(i, 1);
  int q;
  scanf("%d", &q);
  while (q--) {
    int op, x, y;
    scanf("%d%d%d", &op, &x, &y);
    if (op == 1)
      printf("%d\n", query(x, y));
    else {
      swap(num[x], num[y]);
      swap(pos[num[x]], pos[num[y]]);
      int t1 = num[x], t2 = num[y];
      updates(t1), updates(t2);
      if (t1 < n) updates(t1 + 1);
      if (t2 < n) updates(t2 + 1);
    }
  }
}

```