#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
const long long inf = numeric_limits<long long>::max() / 2;
const long double eps = 1e-9;
const long double pi = acos(-1);
struct sqrtd {
  vector<long long> a;
  vector<vector<long long> > t;
  vector<vector<long long> > cnt;
  vector<long long> bs;
  long long SQRT = 6237;
  sqrtd() {}
  sqrtd(vector<long long> as) {
    a = as;
    build();
  }
  void build() {
    long long n = (long long)((a).size());
    bs.clear();
    t.assign(n / SQRT + 1, {});
    bs.assign(n / SQRT + 1, 0);
    cnt.assign(n / SQRT + 1, {});
    for (long long i = 0; i < n; i++) {
      t[i / SQRT].push_back(a[i]);
      bs[i / SQRT] += a[i];
      if (cnt[i / SQRT].size() <= a[i]) {
        cnt[i / SQRT].resize(a[i] + 1);
      }
      ++cnt[i / SQRT][a[i]];
    }
  }
  void rebuild() {
    a.clear();
    for (long long i = 0; i < (long long)((t).size()); i++) {
      for (long long j = 0; j < (long long)((t[i]).size()); j++) {
        a.push_back(t[i][j]);
      }
    }
    build();
  }
  void print() {
    for (long long i = 0; i < (long long)((t).size()); i++) {
      for (long long j = 0; j < (long long)((t[i]).size()); j++) {
        cout << t[i][j] << " ";
      }
    }
    cout << endl;
  }
  long long get(long long k, long long L, long long R) {
    long long ans = 0;
    long long cl = 0, cr = 0;
    for (long long i = 0; i < (long long)((t).size()); i++) {
      if (t[i].empty()) {
        break;
      }
      cr = cl + (long long)((t[i]).size()) - 1;
      if (L <= cl && cr <= R) {
        if (cnt[i].size() > k) {
          ans += cnt[i][k];
        }
      } else {
        for (long long j = max(cl, L); j <= min(cr, R); j++) {
          if (t[i][j - cl] == k) {
            ++ans;
          }
        }
      }
      cl += (long long)((t[i]).size());
    }
    return ans;
  }
  void rotate(long long L, long long R) {
    long long cl = 0, cr = 0;
    pair<long long, long long> lpos = {-1, -1}, rpos = {-1, -1};
    for (int i = 0; i < (long long)((t).size()); i++) {
      cr = cl + (long long)((t[i]).size()) - 1;
      if (cl <= L && L <= cr) {
        lpos = {i, L - cl};
      }
      if (cl <= R && R <= cr) {
        rpos = {i, R - cl};
      }
      cl += (long long)((t[i]).size());
    }
    long long rg = t[rpos.first][rpos.second];
    t[rpos.first].erase(t[rpos.first].begin() + rpos.second);
    t[lpos.first].insert(t[lpos.first].begin() + lpos.second, rg);
    --cnt[rpos.first][rg];
    if ((long long)((cnt[lpos.first]).size()) <= rg) {
      cnt[lpos.first].resize(rg + 1);
    }
    ++cnt[lpos.first][rg];
  }
};
long long N, Q;
vector<long long> a;
sqrtd s;
void solve() {
  long long prev = 0;
  s = sqrtd(a);
  for (long long i = 0; i < Q; i++) {
    if (i % s.SQRT == 0) {
      s.rebuild();
    }
    long long op, L, R;
    cin >> op >> L >> R;
    L = ((L + prev - 1) % N) + 1;
    R = ((R + prev - 1) % N) + 1;
    --L, --R;
    if (R < L) {
      swap(L, R);
    }
    if (op == 1) {
      s.rotate(L, R);
    } else {
      long long k;
      cin >> k;
      k = ((k + prev - 1) % N) + 1;
      prev = s.get(k, L, R);
      cout << prev << "\n";
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> N;
  a.resize(N);
  for (long long i = 0; i < N; i++) {
    cin >> a[i];
  }
  cin >> Q;
  solve();
  return 0;
}
