Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Serega and Fun

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputSerega loves fun. However, everyone has fun in the unique manner. Serega has fun by solving query problems. One day Fedor came up with such a problem.

You are given an array *a* consisting of *n* positive integers and queries to it. The queries can be of two types:

- Make a unit cyclic shift to the right on the segment from
*l*to*r*(both borders inclusive). That is rearrange elements of the array in the following manner:*a*[*l*],*a*[*l*+ 1], ...,*a*[*r*- 1],*a*[*r*] →*a*[*r*],*a*[*l*],*a*[*l*+ 1], ...,*a*[*r*- 1]. - Count how many numbers equal to
*k*are on the segment from*l*to*r*(both borders inclusive).

Fedor hurried to see Serega enjoy the problem and Serega solved it really quickly. Let's see, can you solve it?

Input

The first line contains integer *n* (1 ≤ *n* ≤ 10^{5}) — 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^{5}) — 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:

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.

Examples

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

Output

2

1

0

0

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

Output

2

0

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/23/2020 14:34:06 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|