#include <bits/stdc++.h>
using namespace std;
const int mxn = 1e5 + 5;
const int sqn = 320;
int n, q;
int a[mxn];
bool flag = 0;
struct bucket {
  int cnt[mxn], sz, elem[sqn * 2 + 5];
  void clean() {
    while (sz) {
      cnt[elem[--sz]]--;
    }
    return;
  }
  void add(int pos, int x) {
    cnt[x]++;
    pos--;
    for (int i = sz - 1; i >= pos; i--) {
      elem[i + 1] = elem[i];
    }
    sz++;
    elem[pos] = x;
  }
  int del(int pos) {
    int ret = elem[--pos];
    for (int i = pos; i < sz - 1; i++) {
      elem[i] = elem[i + 1];
    }
    sz--;
    cnt[ret]--;
    return ret;
  }
  int query(int x, int y, int k) {
    if (x == 1 && y == sz) return cnt[k];
    int ret = 0;
    for (int i = x - 1; i < y; i++) ret += elem[i] == k;
    return ret;
  }
} bkt[sqn];
void init() {
  for (int i = 0; i < sqn; i++) {
    bkt[i].clean();
  }
  for (int i = 0; i < n; i++) {
    bkt[i / sqn].add(i % sqn + 1, a[i]);
  }
}
void reset() {
  int ptr = 0;
  for (int i = 0; i < sqn; i++)
    for (int j = 0; j < bkt[i].sz; j++) a[ptr++] = bkt[i].elem[j];
  flag = 0;
}
void add(int pos, int x) {
  for (int i = 0; i < sqn; i++) {
    if (pos <= bkt[i].sz) {
      bkt[i].add(pos, x);
      if (bkt[i].sz >= 2 * sqn) flag = 1;
      return;
    } else {
      pos -= bkt[i].sz;
    }
  }
}
int del(int pos) {
  for (int i = 0; i < sqn; i++) {
    if (pos <= bkt[i].sz) {
      return bkt[i].del(pos);
    } else {
      pos -= bkt[i].sz;
    }
  }
  return 0;
}
int query(int x, int y, int k) {
  int u = 0, ret = 0;
  for (int i = 0; i < sqn; i++) {
    int st = u + 1;
    int en = u + bkt[i].sz;
    st = max(st, x);
    en = min(en, y);
    if (st <= en) ret += bkt[i].query(st - u, en - u, k);
    u += bkt[i].sz;
  }
  return ret;
}
signed main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  init();
  scanf("%d", &q);
  int lastans = 0;
  while (q--) {
    int t, le, ri, k;
    scanf("%d", &t);
    if (t == 1) {
      scanf("%d%d", &le, &ri);
    } else {
      scanf("%d%d%d", &le, &ri, &k);
    }
    le = (le + lastans - 1 + n) % n + 1;
    ri = (ri + lastans - 1 + n) % n + 1;
    k = (k + lastans - 1 + n) % n + 1;
    if (le > ri) swap(le, ri);
    if (t == 1) {
      int deleted = del(ri);
      add(le, deleted);
    } else {
      lastans = query(le, ri, k);
      printf("%d\n", lastans);
    }
    if (flag) {
      reset();
      init();
    }
  }
}
