#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
const int Maxn = 1000010, Maxm = 100005, Mo = 1000000007,
          sp[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
const long long oo = INT_MAX >> 2;
struct Tree {
  int l, r, cnt;
};
struct edge {
  int u, v, len;
};
typedef int IArr[Maxn];
typedef long long LArr[Maxn];
typedef double DArr[Maxn];
IArr x, y, sx, sy;
int n, i, j, ans;
vector<int> vt[Maxn];
void ins(int pos, int key) {
  while (pos <= n) {
    vt[pos].push_back((key));
    pos += pos & -pos;
  }
}
int ask(int pos, int key) {
  int ans = 0;
  while (pos) {
    ans += upper_bound(vt[pos].begin(), vt[pos].end(), key) - vt[pos].begin();
    pos ^= pos & -pos;
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  for (i = 1; i <= n; i++) {
    int a;
    cin >> a;
    x[a] = i;
  }
  for (i = 1; i <= n; i++) {
    int a;
    cin >> a;
    y[a] = i;
  }
  for (i = 1; i <= n; i++) ins(x[i], y[i]);
  for (i = 1; i <= n; i++) sort(vt[i].begin(), vt[i].end());
  int ct = 0, q, a, b, c, d;
  cin >> q;
  while (q--) {
    cin >> a >> b >> c >> d;
    a = (a - 1 + ct) % n + 1;
    b = (b - 1 + ct) % n + 1;
    c = (c - 1 + ct) % n + 1;
    d = (d - 1 + ct) % n + 1;
    int a1 = min(a, b), b1 = max(a, b), c1 = min(c, d), d1 = max(c, d);
    ct = ask(b1, d1) - ask(b1, c1 - 1) - ask(a1 - 1, d1) + ask(a1 - 1, c1 - 1);
    cout << ct++ << endl;
  }
}
