#include <bits/stdc++.h>
using namespace std;
const long double EPS = (long double)1e-7;
const long double PI = acos(0) * 2;
bool isZero(const long double& x) { return abs(x) <= EPS; }
int sign(const long double& x) { return isZero(x) ? 0 : (0 < x ? 1 : -1); }
long long gcd(long long a, long long b) {
  for (; b; a %= b, swap(a, b)) {
  }
  return abs(a);
}
pair<long long, long long> operator+(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return pair<long long, long long>(a.first + b.first, a.second + b.second);
}
pair<long long, long long> operator-(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return pair<long long, long long>(a.first - b.first, a.second - b.second);
}
pair<long long, long long> operator*(const pair<long long, long long>& a,
                                     const long long& b) {
  return pair<long long, long long>(a.first * b, a.second * b);
}
long long operator*(const pair<long long, long long>& a,
                    const pair<long long, long long>& b) {
  return a.first * b.second - b.first * a.second;
}
long long ccw(const pair<long long, long long>& a,
              const pair<long long, long long>& b,
              const pair<long long, long long>& c) {
  return a * b + b * c + c * a;
}
void fg(vector<int> G[], int a, int b) {
  G[a].emplace_back(b);
  G[b].emplace_back(a);
}
void fg(vector<pair<int, int> > G[], int a, int b, int c) {
  G[a].emplace_back(b, c);
  G[b].emplace_back(a, c);
}
const int MAXN = 100005;
const int SQRN = 320;
int A[SQRN][MAXN];
deque<int> B[SQRN];
int N, Q;
void f(int p, int q) {
  if (p >= q) return;
  int pi = p / SQRN, qi = q / SQRN;
  int pj = p % SQRN, qj = q % SQRN;
  if (pi == qi) {
    rotate(B[pi].begin() + pj, B[pi].begin() + qj, B[pi].begin() + qj + 1);
    return;
  }
  for (int i = pi, x; i < qi; i++) {
    x = B[i].back();
    B[i].pop_back();
    B[i + 1].emplace_front(x);
    A[i][x]--;
    A[i + 1][x]++;
  }
  {
    int x = B[qi][qj + 1];
    B[qi].erase(B[qi].begin() + qj + 1);
    B[pi].insert(B[pi].begin() + pj, x);
    A[qi][x]--;
    A[pi][x]++;
  }
}
int f(int p, int q, int x) {
  int pi = p / SQRN, qi = q / SQRN;
  int pj = p % SQRN, qj = q % SQRN;
  int ret = 0;
  if (pi == qi) {
    for (int i = pj; i <= qj; i++)
      if (B[pi][i] == x) ret++;
    return ret;
  }
  for (int i = ((int)(B[pi]).size()) - 1; pj <= i; i--)
    if (B[pi][i] == x) ret++;
  for (int i = qj; 0 <= i; i--)
    if (B[qi][i] == x) ret++;
  for (int i = pi + 1; i < qi; i++) ret += A[i][x];
  return ret;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> N;
  for (int i = 0, c, bi; i < N; i++) {
    cin >> c;
    bi = i / SQRN;
    A[bi][c]++;
    B[bi].emplace_back(c);
  }
  cin >> Q;
  for (int t, a, b, c, pv = 0; Q--;) {
    cin >> t >> a >> b;
    if (2 == t) cin >> c;
    a = (a + pv - 1) % N;
    b = (b + pv - 1) % N;
    c = (c + pv - 1) % N + 1;
    if (a > b) swap(a, b);
    if (1 == t)
      f(a, b);
    else
      cout << (pv = f(a, b, c)) << '\n';
  }
  return 0;
}
