#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, x, a[N], b[N], ans;
vector<int> t[4 * N];
inline int f(int z) { return ((z - 1 + ans) % n + n) % n + 1; }
void build(int v, int l, int r) {
  if (l == r) {
    t[v].push_back(a[l]);
    return;
  }
  int mid = (r + l) >> 1;
  build(v + v, l, mid);
  build(v + v + 1, mid + 1, r);
  merge(t[v + v].begin(), t[v + v].end(), t[v + v + 1].begin(),
        t[v + v + 1].end(), back_inserter(t[v]));
}
void get(int v, int l, int r, int tl, int tr, int x, int y) {
  if (l > r || l > tr || tl > r) {
    return;
  }
  if (tl <= l && r <= tr) {
    int val = int(upper_bound(t[v].begin(), t[v].end(), y) -
                  lower_bound(t[v].begin(), t[v].end(), x));
    ans += val;
    return;
  }
  int mid = (r + l) >> 1;
  get(v + v, l, mid, tl, tr, x, y);
  get(v + v + 1, mid + 1, r, tl, tr, x, y);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x;
    b[x] = i;
  }
  for (int i = 1; i <= n; i++) {
    cin >> x;
    a[i] = b[x];
  }
  build(1, 1, n);
  int m;
  cin >> m;
  for (int i = 1; i <= m; i++) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    a = f(a);
    b = f(b);
    c = f(c);
    d = f(d);
    if (a > b) {
      swap(a, b);
    }
    if (c > d) {
      swap(c, d);
    }
    ans = 0;
    get(1, 1, n, c, d, a, b);
    cout << ans << "\n";
    ans++;
  }
}
