#include <bits/stdc++.h>
using namespace std;
struct bck {
  int sz, cnt[100010], a[650];
};
int N, Q, a[100010], sqr, K;
bck el[330];
void rebuild() {
  int i, j, t = 0;
  for (i = 1; i <= K; i++)
    for (j = 1; j <= el[i].sz; j++) {
      a[++t] = el[i].a[j];
      el[i].cnt[el[i].a[j]] = 0;
    }
  K = 0;
  for (i = 1; i <= N; i += sqr) {
    K++;
    el[K].sz = 0;
    for (j = i; j <= min(N, i + sqr - 1); j++) {
      el[K].sz++;
      el[K].a[el[K].sz] = a[j];
      el[K].cnt[a[j]]++;
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> N;
  int i, j, l, r, k, ans = 0, op, tot, t, ind, val, ind2;
  sqr = 1;
  while (sqr * sqr <= N) sqr++;
  sqr--;
  for (i = 1; i <= N; i++) cin >> a[i];
  for (i = 1; i <= N; i += sqr) {
    K++;
    el[K].sz = 0;
    for (j = i; j <= min(N, i + sqr - 1); j++) {
      el[K].sz++;
      el[K].a[el[K].sz] = a[j];
      el[K].cnt[a[j]]++;
    }
  }
  cin >> Q;
  for (t = 1; t <= Q; t++) {
    if (t % sqr == 0) rebuild();
    cin >> op >> l >> r;
    l = (ans + l - 1) % N + 1;
    r = (ans + r - 1) % N + 1;
    if (l > r) swap(l, r);
    if (op == 1) {
      if (l == r) continue;
      tot = 0;
      for (ind = 1; tot + el[ind].sz < r; ind++) tot += el[ind].sz;
      val = el[ind].a[r - tot];
      for (i = r - tot; i < el[ind].sz; i++) el[ind].a[i] = el[ind].a[i + 1];
      el[ind].cnt[val]--;
      el[ind].sz--;
      tot = 0;
      for (ind = 1; tot + el[ind].sz < l; ind++) tot += el[ind].sz;
      for (i = el[ind].sz + 1; i > l - tot; i--)
        el[ind].a[i] = el[ind].a[i - 1];
      el[ind].a[l - tot] = val;
      el[ind].cnt[val]++;
      el[ind].sz++;
    } else {
      cin >> k;
      k = (ans + k - 1) % N + 1;
      ans = 0, tot = 0;
      for (ind = 1; tot + el[ind].sz < l; ind++) tot += el[ind].sz;
      for (i = l - tot; i <= min(el[ind].sz, r - tot); i++)
        if (el[ind].a[i] == k) ans++;
      tot = 0;
      for (ind2 = 1; tot + el[ind2].sz < r; ind2++) {
        tot += el[ind2].sz;
        if (ind2 > ind) ans += el[ind2].cnt[k];
      }
      if (ind2 != ind) {
        for (i = 1; i <= r - tot; i++)
          if (el[ind2].a[i] == k) ans++;
      }
      cout << ans << "\n";
    }
  }
  return 0;
}
