#include <bits/stdc++.h>
using namespace std;
using LL = int64_t;
using pii = pair<int, int>;
const double EPS = 1e-9;
const double PI = 2 * asin(1);
const int INF = 0x3f3f3f3f;
const LL LINF = 0x3f3f3f3f3f3f3f3f;
const int MX = 100000 + 10;
const int NM = 318;
int g_n, a[MX], cnt[NM][MX];
deque<deque<int>> ddi;
void pretreat() {}
bool input() {
  cin >> g_n;
  if (cin.eof()) return false;
  memset(cnt, 0, sizeof(cnt));
  ddi.clear(), ddi.resize(NM + 1);
  for (int i = 0, t; i < g_n; ++i) {
    scanf(" %d", &t);
    ++cnt[i / NM][t];
    ddi[i / NM].push_back(t);
  }
  return true;
}
void solve() {
  int ans = 0, q;
  cin >> q;
  while (q--) {
    int t, u, v, k;
    scanf(" %d %d %d", &t, &u, &v);
    u = (u + ans - 1) % g_n;
    v = (v + ans - 1) % g_n;
    if (u > v) swap(u, v);
    int block_u = u / NM, pos_u = u % NM;
    int block_v = v / NM, pos_v = v % NM;
    if (t == 1) {
      k = ddi[block_v][pos_v];
      ddi[block_v].erase(ddi[block_v].begin() + pos_v);
      ddi[block_u].insert(ddi[block_u].begin() + pos_u, k);
      ++cnt[block_u][k], --cnt[block_v][k];
      for (int i = block_u; i < block_v; ++i) {
        k = ddi[i].back();
        ddi[i].pop_back();
        ddi[i + 1].push_front(k);
        ++cnt[i + 1][k], --cnt[i][k];
      }
    } else if (t == 2) {
      scanf(" %d", &k);
      k = (k + ans - 1) % g_n + 1;
      ans = 0;
      if (block_u == block_v) {
        for (int i = pos_u; i <= pos_v; ++i) {
          if (ddi[block_u][i] == k) ++ans;
        }
      } else {
        for (int i = pos_u; i < NM; ++i) {
          if (ddi[block_u][i] == k) ++ans;
        }
        for (int i = block_u + 1; i < block_v; ++i) {
          ans += cnt[i][k];
        }
        for (int i = 0; i <= pos_v; ++i) {
          if (ddi[block_v][i] == k) ++ans;
        }
      }
      printf("%d\n", ans);
    }
  }
}
int main() {
  pretreat();
  while (input()) {
    solve();
  }
  return 0;
}
