#include <bits/stdc++.h>
using namespace std;
const int rt = 374;
int n, A[100010], q, t, l, r, k, lastAns, ans;
int myBlock[100010], blocks = -1, iniBlock[rt], finBlock[rt];
int bu[rt][100010];
deque<int> pseudoList[rt], split1, split2;
void bruteForce() {
  int currentBlock = myBlock[l];
  split1.clear();
  split2.clear();
  for (int i = iniBlock[currentBlock]; i < l; i++) {
    if (pseudoList[currentBlock].empty()) break;
    split1.push_back(pseudoList[currentBlock].front());
    pseudoList[currentBlock].pop_front();
  }
  for (int i = finBlock[currentBlock]; i > r; i--) {
    if (pseudoList[currentBlock].empty()) break;
    split2.push_front(pseudoList[currentBlock].back());
    pseudoList[currentBlock].pop_back();
  }
  int newVal = pseudoList[currentBlock].back();
  pseudoList[currentBlock].push_front(newVal);
  pseudoList[currentBlock].pop_back();
  while (!split1.empty()) {
    pseudoList[currentBlock].push_front(split1.back());
    split1.pop_back();
  }
  while (!split2.empty()) {
    pseudoList[currentBlock].push_back(split2.front());
    split2.pop_front();
  }
  return;
}
void update() {
  if (l == r) return;
  if (myBlock[l] == myBlock[r]) {
    bruteForce();
    return;
  }
  int blockL = myBlock[l], blockR = myBlock[r];
  for (int i = blockL + 1; i <= blockR; i++) {
    bu[i][pseudoList[i - 1].back()]++;
    bu[i - 1][pseudoList[i - 1].back()]--;
    pseudoList[i].push_front(pseudoList[i - 1].back());
    pseudoList[i - 1].pop_back();
  }
  split1.clear();
  split2.clear();
  for (int i = finBlock[blockL]; i > l; i--) {
    if (pseudoList[blockL].empty()) break;
    split1.push_front(pseudoList[blockL].back());
    pseudoList[blockL].pop_back();
  }
  for (int i = finBlock[blockR]; i > r; i--) {
    if (pseudoList[blockR].empty()) break;
    split2.push_front(pseudoList[blockR].back());
    pseudoList[blockR].pop_back();
  }
  int newVal = pseudoList[blockR].back();
  split1.push_front(newVal);
  pseudoList[blockR].pop_back();
  bu[blockL][newVal]++;
  bu[blockR][newVal]--;
  while (!split1.empty()) {
    pseudoList[blockL].push_back(split1.front());
    split1.pop_front();
  }
  while (!split2.empty()) {
    pseudoList[blockR].push_back(split2.front());
    split2.pop_front();
  }
  return;
}
int solve(int L_, int R_) {
  int ans_ = 0;
  if (myBlock[L_] == myBlock[R_]) {
    int b_ = myBlock[L_];
    split1.clear();
    for (int i = finBlock[b_]; i > R_; i--) {
      if (pseudoList[b_].empty()) break;
      split1.push_front(pseudoList[b_].back());
      pseudoList[b_].pop_back();
    }
    for (int i = R_; i >= L_; i--) {
      if (pseudoList[b_].empty()) break;
      split1.push_front(pseudoList[b_].back());
      pseudoList[b_].pop_back();
      if (split1.front() == k) ans_++;
    }
    while (!split1.empty()) {
      pseudoList[b_].push_back(split1.front());
      split1.pop_front();
    }
    return ans_;
  }
  int blockL = myBlock[L_], blockR = myBlock[R_];
  for (int i = blockL + 1; i < blockR; i++) ans_ += bu[i][k];
  return ans_ + solve(L_, finBlock[blockL]) + solve(iniBlock[blockR], R_);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  int sig = 0;
  for (int i = 0; i < n; i++) {
    cin >> A[i];
    if (i == sig) {
      sig += rt;
      blocks++;
      iniBlock[blocks] = i;
      if (i > 0) finBlock[blocks - 1] = i - 1;
    }
    myBlock[i] = blocks;
    pseudoList[blocks].push_back(A[i]);
    bu[blocks][A[i]]++;
  }
  finBlock[blocks] = n - 1;
  cin >> q;
  while (q--) {
    cin >> t >> l >> r;
    t--;
    l = (l + lastAns - 1) % n;
    r = (r + lastAns - 1) % n;
    if (l > r) swap(l, r);
    if (!t) {
      update();
    } else {
      cin >> k;
      k = ((k + lastAns - 1) % n) + 1;
      ans = solve(l, r);
      cout << ans << "\n";
      lastAns = ans;
    }
  }
  return 0;
}
