#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;
}

### Prompt

Please formulate a cpp solution to the following problem:

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;
#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;
}

```