#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10, SQRT = 320;
int N, M;
short cnt[MAXN][SQRT];
deque<int> dq[SQRT];
int get(int x) { return dq[x / SQRT][x % SQRT]; }
int main() {
  if (fopen("input.txt", "r")) {
    freopen("input.txt", "r", stdin);
  }
  scanf("%d", &N);
  for (int i = 0, x; i < N; i++) {
    scanf("%d", &x);
    dq[i / SQRT].push_back(x);
    cnt[x][i / SQRT]++;
  }
  scanf("%d", &M);
  int lastans = 0;
  int qt, lt, rt, x;
  for (int qi = 0; qi < M; qi++) {
    scanf("%d %d %d", &qt, &lt, &rt);
    lt = (lt + lastans - 1) % N;
    rt = (rt + lastans - 1) % N;
    if (lt > rt) {
      swap(lt, rt);
    }
    if (qt == 1) {
      if (lt / SQRT == rt / SQRT) {
        deque<int> &d = dq[lt / SQRT];
        lt %= SQRT;
        rt %= SQRT;
        rotate(d.begin() + lt, d.begin() + rt, d.begin() + rt + 1);
      } else {
        int last = get(rt);
        dq[rt / SQRT].erase(dq[rt / SQRT].begin() + rt % SQRT);
        cnt[last][rt / SQRT]--;
        for (int i = rt / SQRT; i > lt / SQRT; i--) {
          int val = dq[i - 1].back();
          dq[i].push_front(val);
          cnt[val][i]++;
          dq[i - 1].pop_back();
          cnt[val][i - 1]--;
        }
        dq[lt / SQRT].insert(dq[lt / SQRT].begin() + lt % SQRT, last);
        cnt[last][lt / SQRT]++;
      }
    } else {
      scanf("%d", &x);
      x = (x + lastans - 1) % N + 1;
      int ans = 0;
      for (; lt <= rt && lt % SQRT; lt++) {
        ans += (get(lt) == x);
      }
      for (; rt >= lt && rt % SQRT != SQRT - 1; rt--) {
        ans += (get(rt) == x);
      }
      if (lt <= rt) {
        lt /= SQRT;
        rt /= SQRT;
        for (int i = lt; i <= rt; i++) {
          ans += cnt[x][i];
        }
      }
      lastans = ans;
      printf("%d\n", ans);
    }
  }
}
