#include <bits/stdc++.h>
using namespace std;
deque<int>::iterator it;
struct node {
  deque<int> q;
  int num[100005];
} block[405];
int s, sn, n, m;
void init(void) {
  int x, b;
  scanf("%d", &n);
  s = pow(n, 0.618);
  if (n % s == 0)
    sn = n / s;
  else
    sn = n / s + 1;
  for (int i = 0; i < n; i++) {
    scanf("%d", &x);
    b = i / s;
    block[b].q.push_back(x);
    block[b].num[x]++;
  }
  scanf("%d", &m);
}
void work(void) {
  int ans = 0;
  int a, b, aa, bb, k, l, r, tmp, x, v;
  while (m--) {
    scanf("%d%d%d", &k, &l, &r);
    l = ((l + ans - 1) % n);
    r = ((r + ans - 1) % n);
    if (l >= r) swap(l, r);
    a = l / s, b = r / s;
    aa = l % s, bb = r % s;
    if (k == 1) {
      if (a == b) {
        it = block[b].q.begin() + bb;
        tmp = *it;
        block[b].q.erase(block[b].q.begin() + bb);
        block[b].q.insert(block[b].q.begin() + aa, tmp);
      } else {
        it = block[b].q.begin() + bb;
        tmp = *it;
        block[b].q.erase(block[b].q.begin() + bb);
        block[b].num[tmp]--;
        for (int i = a; i < b; i++) {
          x = block[i].q.back();
          block[i].q.pop_back();
          block[i].num[x]--;
          block[i + 1].q.push_front(x);
          block[i + 1].num[x]++;
        }
        block[a].q.insert(block[a].q.begin() + aa, tmp);
        block[a].num[tmp]++;
      }
    } else {
      scanf("%d", &v);
      v = ((v + ans - 1) % n) + 1;
      ans = 0;
      if (a == b) {
        for (it = block[a].q.begin() + aa; it <= block[a].q.begin() + bb; it++)
          if (*it == v) ans++;
      } else {
        for (int i = a + 1; i < b; i++) ans += block[i].num[v];
        for (it = block[a].q.begin() + aa; it < block[a].q.end(); it++)
          if (*it == v) ans++;
        for (it = block[b].q.begin(); it <= block[b].q.begin() + bb; it++)
          if (*it == v) ans++;
      }
      printf("%d\n", ans);
    }
  }
}
int main(void) {
  init();
  work();
  return 0;
}
