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>
static constexpr int MAXN = 1e5;
static constexpr int SQRT = 317;
static int cnt[SQRT][MAXN + 1];
static int which_bucket[MAXN];
static int buck_start[SQRT];
static int buck_end[SQRT];
static std::vector<int> buckets[SQRT];
void rebucket() {
  int tot_idx = 0;
  std::vector<int> values;
  for (int i = 0; i < SQRT; i++) {
    for (int value : buckets[i]) {
      cnt[i][value] = 0;
    }
  }
  for (int i = 0; i < SQRT; i++) {
    buck_start[i] = i * SQRT;
    buck_end[i] = (i + 1) * SQRT - 1;
    for (int value : buckets[i]) {
      which_bucket[tot_idx] = tot_idx / SQRT;
      cnt[tot_idx / SQRT][value]++;
      values.push_back(value);
      tot_idx++;
    }
    buckets[i].clear();
  }
  for (int i = 0; i < tot_idx; i++) {
    buckets[which_bucket[i]].push_back(values[i]);
  }
}
int main() {
  int size;
  std::scanf("%d", &size);
  for (int i = 0; i < size; i++) {
    int next;
    std::scanf("%d", &next);
    int buck = i / SQRT;
    cnt[i / SQRT][next]++;
    buckets[i / SQRT].push_back(next);
    which_bucket[i] = buck;
  }
  for (int i = 0; i < SQRT; i++) {
    buck_start[i] = i * SQRT;
    buck_end[i] = (i + 1) * SQRT - 1;
  }
  int qcount;
  std::scanf("%d", &qcount);
  int last_answer = 0;
  for (int i = 0; i < qcount; i++) {
    int type;
    std::scanf("%d", &type);
    if (type == 1) {
      int left, right;
      std::scanf("%d %d", &left, &right);
      left = (left + last_answer - 1) % size;
      right = (right + last_answer - 1) % size;
      if (left > right) std::swap(left, right);
      int start_buck = which_bucket[left];
      int end_buck = which_bucket[right];
      int start_buck_idx = left - buck_start[start_buck];
      int end_buck_idx = right - buck_start[end_buck];
      int value = buckets[end_buck][end_buck_idx];
      buckets[end_buck].erase(buckets[end_buck].begin() + end_buck_idx);
      buckets[start_buck].insert(buckets[start_buck].begin() + start_buck_idx,
                                 value);
      cnt[start_buck][value]++;
      cnt[end_buck][value]--;
      if (buckets[end_buck].empty() || buckets[start_buck].size() > 2 * SQRT) {
        rebucket();
        continue;
      }
      if (start_buck != end_buck) {
        for (int j = start_buck; j <= end_buck; j++) {
          if (j != start_buck) buck_start[j]++;
          if (j != end_buck) buck_end[j]++;
          which_bucket[buck_end[j]] = j;
        }
      }
    } else {
      assert(type == 2);
      int left, right, value;
      std::scanf("%d %d %d", &left, &right, &value);
      left = (left + last_answer - 1) % size;
      right = (right + last_answer - 1) % size;
      if (left > right) std::swap(left, right);
      value = 1 + (value + last_answer - 1) % size;
      last_answer = 0;
      int start_buck = which_bucket[left];
      int end_buck = which_bucket[right];
      int buck = start_buck;
      while (buck <= end_buck) {
        if (buck == start_buck) {
          int start = left - buck_start[start_buck];
          for (int i = start; i < buckets[buck].size(); i++) {
            if (i - start == right - left + 1) break;
            last_answer += (buckets[buck][i] == value);
          }
        } else if (buck == end_buck) {
          for (int i = 0; i <= right - buck_start[buck]; i++) {
            last_answer += (buckets[buck][i] == value);
          }
        } else {
          last_answer += cnt[buck][value];
        }
        buck++;
      }
      std::printf("%d\n", last_answer);
    }
  }
  return EXIT_SUCCESS;
}