#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
const int N = 1e5 + 5;
const int INF = 1e18;
const int K = 320;
int n, a[N], cnt[K][N], q, l, r, ty;
deque<int> d[K];
void rebuild() {
  for (int i = 0; i < n; i++) {
    cnt[i / K][a[i]]++;
    d[i / K].push_back(a[i]);
  }
}
void upd(int l, int r) {
  int posr = r % K, posl = l % K, bl = l / K, br = r / K;
  if (bl == br) {
    int z = d[bl][posr];
    d[bl].erase(d[bl].begin() + posr);
    d[bl].insert(d[bl].begin() + posl, z);
    return;
  }
  int z = d[br][posr];
  d[br].erase(d[br].begin() + posr);
  cnt[br][z]--;
  for (int i = br; i > bl; i--) {
    int x = d[i - 1].back();
    d[i].push_front(x);
    d[i - 1].pop_back();
    cnt[i][x]++;
    cnt[i - 1][x]--;
  }
  d[bl].insert(d[bl].begin() + posl, z);
  cnt[bl][z]++;
}
int get(int l, int r, int x) {
  int posr = r % K, posl = l % K, bl = l / K, br = r / K;
  int res = 0;
  if (bl == br) {
    for (int i = posl; i <= posr; i++) {
      if (d[bl][i] == x) res++;
    }
    return res;
  }
  for (int i = posl; i < d[bl].size(); i++) {
    if (d[bl][i] == x) res++;
  }
  for (int i = bl + 1; i < br; i++) {
    res += cnt[i][x];
  }
  for (int i = 0; i <= posr; i++) {
    if (d[br][i] == x) res++;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  rebuild();
  int last = 0;
  cin >> q;
  for (int test = 1; test <= q; test++) {
    cin >> ty >> l >> r;
    l = (l + last - 1) % n;
    r = (r + last - 1) % n;
    if (l > r) swap(l, r);
    if (ty == 1) {
      upd(l, r);
    } else {
      int k;
      cin >> k;
      k = (last + k - 1) % n + 1;
      last = get(l, r, k);
      cout << last << "\n";
    }
  }
  return 0;
}
