#include <bits/stdc++.h>
using namespace std;
struct bucketElement {
  int bucketIndex, localPosition, value;
};
int N, A[100000 + 5], freq[317 + 5][100000 + 5];
vector<int> bucket[317 + 5];
void Read() {
  scanf("%d", &N);
  for (int i = 1; i <= N; ++i) {
    int tmp;
    scanf("%d", &tmp);
    bucket[1].push_back(tmp);
  }
}
void Debug() {}
void Rebuild() {
  int j = 1;
  for (int i = 1; i <= 317; i++) {
    for (int q = 0; q < bucket[i].size(); q++) {
      A[j] = bucket[i][q];
      freq[i][A[j]] = 0;
      j++;
    }
    bucket[i].clear();
  }
  int i = 1;
  for (j = 1; j <= N; j++) {
    bucket[i].push_back(A[j]);
    freq[i][A[j]]++;
    if (bucket[i].size() >= 317) {
      i++;
    }
  }
}
bucketElement Find(int pos) {
  for (int i = 1; i <= 317; i++) {
    if (pos > bucket[i].size()) {
      pos -= bucket[i].size();
    } else {
      bucketElement x;
      x.bucketIndex = i;
      x.localPosition = pos - 1;
      x.value = bucket[i][x.localPosition];
      return x;
    }
  }
}
void Cycle(int from, int to) {
  Debug();
  bucketElement bucketA = Find(from);
  bucketElement bucketB = Find(to);
  bucket[bucketB.bucketIndex].erase(bucket[bucketB.bucketIndex].begin() +
                                    bucketB.localPosition);
  freq[bucketB.bucketIndex][bucketB.value]--;
  bucket[bucketA.bucketIndex].insert(
      bucket[bucketA.bucketIndex].begin() + bucketA.localPosition,
      bucketB.value);
  freq[bucketA.bucketIndex][bucketB.value]++;
  Debug();
}
int HowMany(int from, int to, int val) {
  bucketElement bucketA = Find(from);
  bucketElement bucketB = Find(to);
  if (bucketA.bucketIndex == bucketB.bucketIndex) {
    int ans = 0;
    for (int i = bucketA.localPosition; i <= bucketB.localPosition; i++) {
      if (bucket[bucketA.bucketIndex][i] == val) {
        ans++;
      }
    }
    return ans;
  } else {
    int ans = 0;
    for (int i = bucketA.localPosition; i < bucket[bucketA.bucketIndex].size();
         i++) {
      if (bucket[bucketA.bucketIndex][i] == val) {
        ans++;
      }
    }
    for (int i = 0; i <= bucketB.localPosition; i++) {
      if (bucket[bucketB.bucketIndex][i] == val) {
        ans++;
      }
    }
    for (int i = bucketA.bucketIndex + 1; i <= bucketB.bucketIndex - 1; i++) {
      ans += freq[i][val];
    }
    return ans;
  }
}
void Solve() {
  int Q, lastAns = 0, l, lTonos, r, rTonos, k, kTonos, type;
  scanf("%d", &Q);
  for (int i = 0; i < Q; ++i) {
    if (i % 317 == 0) {
      Rebuild();
    }
    scanf("%d %d %d", &type, &lTonos, &rTonos);
    l = ((lTonos + lastAns - 1) % N) + 1;
    r = ((rTonos + lastAns - 1) % N) + 1;
    if (r < l) {
      swap(l, r);
    }
    if (type == 1) {
      Cycle(l, r);
    } else if (type == 2) {
      scanf("%d", &kTonos);
      k = ((kTonos + lastAns - 1) % N) + 1;
      lastAns = HowMany(l, r, k);
      printf("%d\n", lastAns);
    }
  }
}
int main() {
  Read();
  Solve();
}
