#include <bits/stdc++.h>
using namespace std;
const int MN = 1e5;
const int BS = 320;
int freq[BS][MN + 1];
deque<int> bucket[BS];
int shift(int k, int l, int r, int in) {
  int out = bucket[k][r];
  freq[k][out]--;
  for (int i = r; i > l; i--) {
    bucket[k][i] = bucket[k][i - 1];
  }
  bucket[k][l] = in;
  freq[k][in]++;
  return out;
}
int pos(int k, int i) { return i - k * BS; }
void update(int l, int r) {
  int i = l / BS, j = r / BS;
  if (i == j) {
    shift(i, pos(i, l), pos(j, r), bucket[i][pos(j, r)]);
  } else {
    int in = shift(i, pos(i, l), bucket[i].size() - 1, bucket[j][pos(j, r)]);
    for (int k = i + 1; k < j; k++) {
      bucket[k].push_front(in);
      freq[k][in]++;
      in = bucket[k].back();
      bucket[k].pop_back();
      freq[k][in]--;
    }
    shift(j, 0, pos(j, r), in);
  }
}
int query(int l, int r, int x) {
  int cnt = 0;
  int i = l / BS, j = r / BS;
  if (i == j) {
    for (int k = pos(i, l); k <= pos(j, r); k++) {
      cnt += (bucket[i][k] == x);
    }
  } else {
    for (int k = pos(i, l); k < bucket[i].size(); k++) {
      cnt += (bucket[i][k] == x);
    }
    for (int k = i + 1; k < j; k++) {
      cnt += freq[k][x];
    }
    for (int k = 0; k <= pos(j, r); k++) {
      cnt += (bucket[j][k] == x);
    }
  }
  return cnt;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int x;
    scanf("%d", &x);
    int k = i / BS;
    bucket[k].push_back(x);
    freq[k][x]++;
  }
  int m;
  scanf("%d", &m);
  int last = 0;
  while (m--) {
    int o;
    scanf("%d", &o);
    switch (o) {
      case 1: {
        int l, r;
        scanf("%d %d", &l, &r);
        l = (l + last - 1) % n;
        r = (r + last - 1) % n;
        if (l > r) swap(l, r);
        update(l, r);
        break;
      }
      case 2: {
        int l, r, x;
        scanf("%d %d %d", &l, &r, &x);
        l = (l + last - 1) % n;
        r = (r + last - 1) % n;
        if (l > r) swap(l, r);
        x = (x + last - 1) % n + 1;
        last = (x > n ? 0 : query(l, r, x));
        printf("%d\n", last);
        break;
      }
    }
  }
}
