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 a 1, a 2, ..., a n 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 i 1 < i 2 < ... < i k, that a i 1 = x, a i 2 = x + 1, ..., a i k - 1 = y - 1, a i k = 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, p 1], [p 1 + 1, p 2], ..., [p m + 1, y] (x ≤ p 1 < p 2 < ... < p m < 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:
You can assume that any beaver can be shaved any number of times.
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 p i x i y i, where p i is the query type (1 is to shave beavers from x i to y i, inclusive, 2 is to swap beavers on positions x i and y i). All queries meet the condition: 1 ≤ x i < y i ≤ n.
Note that the number of queries q is limited 1 ≤ q ≤ 105 in both subproblem B1 and subproblem B2.
For each query with p i = 1, print the minimum number of Beavershave 5000 sessions.
1 3 4 2 5
1 1 5
1 3 4
2 2 3
1 1 5
2 1 5
1 1 5