#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 50, SQ = 300, SZ = (N / SQ) + 20, INF = 0, MOD = 0;
int n, a[N], q, cnt[SZ][N];
deque<int> d[SZ];
inline void build() {
  d[0].push_back(-10);
  for (int i = 1; i <= n; i++) {
    int x = i / SQ;
    d[x].push_back(a[i]);
    cnt[x][a[i]]++;
  }
  return;
}
inline void upd(int l, int r) {
  if (l / SQ == r / SQ) {
    vector<int> tmp;
    int en = d[l / SQ].size() - 1, bg = l % SQ;
    for (int i = en; i >= bg; i--) {
      tmp.push_back(d[(l / SQ)].back());
      d[(l / SQ)].pop_back();
    }
    reverse(tmp.begin(), tmp.end());
    d[(l / SQ)].push_back(tmp[r - l]);
    for (int i = 0; i < r - l; i++) d[(l / SQ)].push_back(tmp[i]);
    for (int i = r - l + 1; i < (int)tmp.size(); i++)
      d[l / SQ].push_back(tmp[i]);
    return;
  }
  vector<int> tmp;
  int x = (r % SQ);
  for (int i = 0; i <= x; i++) {
    tmp.push_back(d[(r / SQ)].front());
    d[(r / SQ)].pop_front();
  }
  int R = tmp.back();
  cnt[(r / SQ)][R]--;
  for (int i = (int)tmp.size() - 2; i >= 0; i--) d[(r / SQ)].push_front(tmp[i]);
  for (int i = (r / SQ) - 1; i >= (l / SQ); i--) {
    int x = d[i].back();
    d[i + 1].push_front(x);
    cnt[i][x]--;
    cnt[i + 1][x]++;
    d[i].pop_back();
  }
  tmp.clear();
  int en = d[l / SQ].size() - 1, bg = l % SQ;
  for (int i = en; i >= bg; i--) {
    tmp.push_back(d[(l / SQ)].back());
    d[(l / SQ)].pop_back();
  }
  reverse(tmp.begin(), tmp.end());
  cnt[(l / SQ)][R]++;
  d[(l / SQ)].push_back(R);
  for (int i = 0; i < (int)tmp.size(); i++) d[(l / SQ)].push_back(tmp[i]);
  return;
}
int get(int l, int r, int k, int ans = 0) {
  int L = l % SQ;
  int R = r % SQ;
  if (l / SQ == r / SQ) {
    for (int i = L; i <= R; i++)
      if (d[(l / SQ)][i] == k) ans++;
    return ans;
  }
  for (int i = L; i < (int)d[l / SQ].size(); i++)
    if (d[l / SQ][i] == k) ans++;
  for (int i = (l / SQ) + 1; i < (r / SQ); i++) ans += cnt[i][k];
  for (int i = 0; i <= R; i++)
    if (d[r / SQ][i] == k) ans++;
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  build();
  cin >> q;
  int last = 0;
  for (int i = 0, l, r, k, t; i < q; i++) {
    cin >> t >> l >> r;
    l = ((l + last - 1) % n) + 1;
    r = ((r + last - 1) % n) + 1;
    if (r < l) swap(r, l);
    if (t == 1)
      upd(l, r);
    else {
      cin >> k;
      k = ((k + last - 1) % n) + 1;
      last = get(l, r, k);
      cout << last << '\n';
    }
  }
  return 0;
}
