Problem: Serega 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:

  1. 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].
  2. 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 ≤ 105) — 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 ≤ 105) — 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:

li = ((l'i + lastans - 1) mod n) + 1; ri = ((r'i + lastans - 1) mod n) + 1; ki = ((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 li is greater than ri, 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 17, chk = 320;
deque<int> blocks[chk];
int ctr[chk][N];
int main() {
  std::ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, q, c, l, r, k, prev, lidx, ridx, elem, st, en, num;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> num;
    blocks[i / chk].push_back(num);
    ctr[i / chk][num]++;
  }
  cin >> q;
  prev = 0;
  while (q--) {
    cin >> c >> l >> r;
    l = (l + prev - 1) % n;
    r = (r + prev - 1) % n;
    if (l > r) swap(l, r);
    lidx = l % chk;
    ridx = r % chk;
    st = l / chk;
    en = r / chk;
    elem = blocks[en][ridx];
    if (c == 1) {
      if (st == en) {
        blocks[en].erase(blocks[en].begin() + ridx);
        blocks[en].insert(blocks[en].begin() + lidx, elem);
      } else {
        blocks[en].erase(blocks[en].begin() + ridx);
        ctr[en][elem]--;
        for (int j = en; j > st; j--) {
          int x = blocks[j - 1].back();
          blocks[j - 1].pop_back();
          ctr[j - 1][x]--;
          blocks[j].push_front(x);
          ctr[j][x]++;
        }
        blocks[st].insert(blocks[st].begin() + lidx, elem);
        ctr[st][elem]++;
      }
    } else {
      cin >> k;
      k = (k + prev - 1) % n + 1;
      prev = 0;
      if (st == en) {
        for (int j = lidx; j <= ridx; j++)
          if (blocks[st][j] == k) prev++;
      } else {
        for (int j = lidx; j < chk; j++)
          if (blocks[st][j] == k) prev++;
        for (int j = 0; j <= ridx; j++)
          if (blocks[en][j] == k) prev++;
        for (int j = st + 1; j < en; j++) prev += ctr[j][k];
      }
      cout << prev << "\n";
    }
  }
  return 0;
}