#include <bits/stdc++.h>
using namespace std;
int n, a[100007], sz[350], bl[350][2 * 350], cnt[350][100007], nblock;
void insertbl(int num, int pos, long long val) {
  sz[num]++;
  for (int i = sz[num]; i > pos; --i) bl[num][i] = bl[num][i - 1];
  bl[num][pos] = val;
  cnt[num][val]++;
}
long long erasebl(int num, int pos) {
  long long val = bl[num][pos];
  sz[num]--;
  for (int i = pos; i <= sz[num]; ++i) bl[num][i] = bl[num][i + 1];
  cnt[num][val]--;
  return val;
}
void fromatoblock() {
  nblock = 1;
  for (int i = 1; i <= n; ++i) {
    insertbl(nblock, sz[nblock] + 1, a[i]);
    if (sz[nblock] >= 350) nblock++;
  }
}
void fromblocktoa() {
  long long curr = 0;
  for (int i = 1; i <= nblock; ++i) {
    for (int j = 1; j <= sz[i]; ++j) {
      long long val = bl[i][j];
      a[++curr] = val;
      cnt[i][val]--;
    }
    sz[i] = 0;
  }
}
pair<int, int> blpos(int pos) {
  for (int i = 1; i <= nblock; ++i) {
    if (pos <= sz[i]) return {i, pos};
    pos -= sz[i];
  }
}
long long query(int l, int r, long long k) {
  long long res = 0;
  pair<int, int> p1 = blpos(l), p2 = blpos(r);
  if (p1.first == p2.first) {
    for (int i = p1.second; i <= p2.second; ++i)
      if (bl[p1.first][i] == k) res++;
    return res;
  }
  for (int i = p1.first + 1; i <= p2.first - 1; ++i) res += cnt[i][k];
  for (int i = p1.second; i <= sz[p1.first]; ++i)
    if (bl[p1.first][i] == k) res++;
  for (int i = p2.second; i >= 1; --i)
    if (bl[p2.first][i] == k) res++;
  return res;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  long long q;
  long long lastans = 0;
  cin >> q;
  fromatoblock();
  for (int i = 1; i <= q; ++i) {
    int op, l, r;
    cin >> op >> l >> r;
    l = (l + lastans - 1) % n + 1;
    r = (r + lastans - 1) % n + 1;
    if (l > r) swap(l, r);
    if (op == 1) {
      pair<int, int> p1 = blpos(l), p2 = blpos(r);
      long long val = erasebl(p2.first, p2.second);
      insertbl(p1.first, p1.second, val);
    } else {
      long long k;
      cin >> k;
      k = (k + lastans - 1) % n + 1;
      lastans = query(l, r, k);
      cout << lastans << endl;
    }
    if (i % 350 == 0) {
      fromblocktoa();
      fromatoblock();
    }
  }
  return 0;
}
