#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
vector<int> seg[N * 4];
int n, m;
int pinf[N];
int a[N];
void fil(int p, int val, int v = 1, int s = 1, int e = n + 1) {
  seg[v].push_back(val);
  if (e - s == 1) return;
  if (p < ((s + e) / 2))
    fil(p, val, v * 2, s, ((s + e) / 2));
  else
    fil(p, val, v * 2 + 1, ((s + e) / 2), e);
}
int get(int l, int r, int lw, int hg, int v = 1, int s = 1, int e = n + 1) {
  if (r <= s || e <= l) return 0;
  if (l <= s && e <= r)
    return upper_bound(seg[v].begin(), seg[v].end(), hg) -
           lower_bound(seg[v].begin(), seg[v].end(), lw);
  return get(l, r, lw, hg, v * 2, s, ((s + e) / 2)) +
         get(l, r, lw, hg, v * 2 + 1, ((s + e) / 2), e);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int t;
    scanf("%d", &t);
    pinf[t] = i;
  }
  for (int i = 1; i <= n; i++) {
    int t;
    scanf("%d", &t);
    a[i] = pinf[t];
    fil(i, a[i]);
  }
  for (int i = 1; i < 4 * N; i++) sort(seg[i].begin(), seg[i].end());
  scanf("%d", &m);
  int lstans = -1;
  while (m--) {
    lstans++;
    int l, r, s, e;
    scanf("%d%d%d%d", &l, &r, &s, &e);
    l = ((l - 1 + lstans) % n) + 1;
    r = ((r - 1 + lstans) % n) + 1;
    s = ((s - 1 + lstans) % n) + 1;
    e = ((e - 1 + lstans) % n) + 1;
    if (r < l) swap(l, r);
    if (e < s) swap(s, e);
    lstans = get(s, e + 1, l, r);
    printf("%d\n", lstans);
  }
  return 0;
}
