You are given two permutations p and q, consisting of n elements, and m queries of the form: l1, r1, l2, r2 (l1 ≤ r1; l2 ≤ r2). The response for the query is the number of such integers from 1 to n, that their position in the first permutation is in segment [l1, r1] (borders included), and position in the second permutation is in segment [l2, r2] (borders included too).

A permutation of n elements is the sequence of n distinct integers, each not less than 1 and not greater than n.

Position of number v (1 ≤ v ≤ n) in permutation g1, g2, ..., gn is such number i, that gi = v.

Input

The first line contains one integer n (1 ≤ n ≤ 106), the number of elements in both permutations. The following line contains n integers, separated with spaces: p1, p2, ..., pn (1 ≤ pi ≤ n). These are elements of the first permutation. The next line contains the second permutation q1, q2, ..., qn in same format.

The following line contains an integer m (1 ≤ m ≤ 2·105), that is the number of queries.

The following m lines contain descriptions of queries one in a line. The description of the i-th query consists of four integers: a, b, c, d (1 ≤ a, b, c, d ≤ n). Query parameters l1, r1, l2, r2 are obtained from the numbers a, b, c, d using the following algorithm: 

  1. Introduce variable x. If it is the first query, then the variable equals 0, else it equals the response for the previous query plus one. 
  2. Introduce function f(z) = ((z - 1 + x) mod n) + 1. 
  3. Suppose l1 = min(f(a), f(b)), r1 = max(f(a), f(b)), l2 = min(f(c), f(d)), r2 = max(f(c), f(d)). 

Output

Print a response for each query in a separate line.

Examples

Input

3
3 1 2
3 2 1
1
1 2 3 3


Output

1


Input

4
4 3 2 1
2 3 4 1
3
1 2 3 4
1 3 2 1
1 4 2 3


Output

1
1
2
1
1
1
1
1 1 1 1

1

#include <bits/stdc++.h>
using namespace std;
bool debug = false;
int n, m, k;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
long long ln, lk, lm;
int a[1001005], b[1001005], pp[4];
int t[1001005 * 21], cnt, root[1001005], lc[1001005 * 21], rc[1001005 * 21];
void update(int rt, int &cur, int l, int r, int v) {
  cur = ++cnt;
  if (l + 1 == r) {
    t[cur] = t[rt] + 1;
    return;
  }
  int mid = (l + r) >> 1;
  if (v <= mid) {
    update(lc[rt], lc[cur], l, mid, v);
    rc[cur] = rc[rt];
  } else {
    update(rc[rt], rc[cur], mid, r, v);
    lc[cur] = lc[rt];
  }
  t[cur] = t[lc[cur]] + t[rc[cur]];
}
int qy(int rt, int cur, int l, int r, int L, int R) {
  if (R <= l || r <= L) return 0;
  if (L <= l && r <= R) {
    return t[cur] - t[rt];
  }
  int mid = (l + r) >> 1;
  int x = qy(lc[rt], lc[cur], l, mid, L, R);
  int y = qy(rc[rt], rc[cur], mid, r, L, R);
  return x + y;
}
int f(int x, int z) { return (z - 1 + x) % n + 1; }
int main() {
  scanf("%d", &n);
  for (int(i) = 1; (i) <= (int)(n); (i)++) scanf("%d", a + i);
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    scanf("%d", &k);
    b[k] = i;
  }
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    update(root[i - 1], root[i], 0, n, b[a[i]]);
  }
  int x = 0;
  scanf("%d", &m);
  for (int(i) = 0; (i) < (int)(m); (i)++) {
    for (int(j) = 0; (j) < (int)(4); (j)++) {
      scanf("%d", pp + j);
      pp[j] = f(x, pp[j]);
    }
    int l1 = min(pp[0], pp[1]);
    int r1 = max(pp[0], pp[1]);
    int l2 = min(pp[2], pp[3]);
    int r2 = max(pp[2], pp[3]);
    printf("%d\n", x = qy(root[l1 - 1], root[r1], 0, n, l2 - 1, r2));
    x++;
  }
  return 0;
}
