#include <bits/stdc++.h>
using namespace std;
const int NMAX = 4400000;
int x, n;
int f(int z) { return ((z - 1 + x) % n); }
int a[NMAX], b[NMAX], b1[NMAX], l1, r1, l2, r2;
vector<int> md[NMAX];
void build(int idx, int l, int r) {
  int len = r - l + 1;
  md[idx].resize(len);
  if (l == r) {
    md[idx][0] = a[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(idx << 1, l, mid);
  build(idx << 1 | 1, mid + 1, r);
  merge(md[idx << 1].begin(), md[idx << 1].end(), md[idx << 1 | 1].begin(),
        md[idx << 1 | 1].end(), md[idx].begin());
}
int query(int idx, int l, int r) {
  if (r < l1 || r1 < l) return 0;
  if (l1 <= l && r <= r1) {
    if (r2 < md[idx][0] || md[idx].back() < l2) return 0;
    return int(upper_bound(md[idx].begin(), md[idx].end(), r2) -
               lower_bound(md[idx].begin(), md[idx].end(), l2));
  }
  int mid = (l + r) >> 1;
  return query(idx << 1, l, mid) + query(idx << 1 | 1, mid + 1, r);
}
int main() {
  cin >> n;
  for (int i = 0; i < (int)(n); i++) {
    scanf("%d", &a[i]);
    a[i]--;
  }
  for (int i = 0; i < (int)(n); i++) {
    scanf("%d", &b[i]);
    b[i]--;
  }
  for (int i = 0; i < (int)(n); i++) b1[b[i]] = i;
  for (int i = 0; i < (int)(n); i++) a[i] = b1[a[i]];
  build(1, 0, n - 1);
  int m;
  scanf("%d", &m);
  for (int i = 0; i < (int)(m); i++) {
    int a, b, c, d;
    scanf("%d%d%d%d", &a, &b, &c, &d);
    l1 = min(f(a), f(b));
    r1 = max(f(a), f(b));
    l2 = min(f(c), f(d));
    r2 = max(f(c), f(d));
    x = query(1, 0, n - 1);
    printf("%d\n", x);
    x++;
  }
  return 0;
}
