Serega and Fun

Description:

Input:

The first line contains integer n (1 ≤ n ≤ 10⁵) — the number of elements of the array. The second line contains n integers a[1], a[2], ..., a[n] (1 ≤ a[i] ≤ n).

The third line contains a single integer q (1 ≤ q ≤ 10⁵) — the number of queries. The next q lines contain the queries.

As you need to respond to the queries online, the queries will be encoded. A query of the first type will be given in format: 1 l'_i r'_i. A query of the second type will be given in format: 2 l'_i r'_i k'_i. All the number in input are integer. They satisfy the constraints: 1 ≤ l'_i, r'_i, k'_i ≤ n.

To decode the queries from the data given in input, you need to perform the following transformations:

l_i = ((l'_i + lastans - 1) mod n) + 1; r_i = ((r'_i + lastans - 1) mod n) + 1; k_i = ((k'_i + lastans - 1) mod n) + 1.

Where lastans is the last reply to the query of the 2-nd type (initially, lastans = 0). If after transformation l_i is greater than r_i, you must swap these values.

Output:

For each query of the 2-nd type print the answer on a single line.

Sample Input:

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

Sample Output:

2
1
0
0

Sample Input:

8
8 4 2 2 7 7 8 8
8
1 8 8
2 8 1 7
1 8 1
1 7 3
2 8 8 3
1 1 4
1 2 7
1 4 5

Sample Output:

2
0