You are given two permutations p and q, consisting of n elements, and m queries of the form: l₁, r₁, l₂, r₂ (l₁ ≤ r₁; l₂ ≤ r₂). 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 [l₁, r₁] (borders included), and position in the second permutation is in segment [l₂, r₂] (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 g₁, g₂, ..., g_n is such number i, that g_i = v.

Input

The first line contains one integer n (1 ≤ n ≤ 10⁶), the number of elements in both permutations. The following line contains n integers, separated with spaces: p₁, p₂, ..., p_n (1 ≤ p_i ≤ n). These are elements of the first permutation. The next line contains the second permutation q₁, q₂, ..., q_n in same format.

The following line contains an integer m (1 ≤ m ≤ 2·10⁵), 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 l₁, r₁, l₂, r₂ are obtained from the numbers a, b, c, d using the following algorithm:

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.
Introduce function f(z) = ((z - 1 + x) mod n) + 1.
Suppose l₁ = min(f(a), f(b)), r₁ = max(f(a), f(b)), l₂ = min(f(c), f(d)), r₂ = max(f(c), f(d)).

Output

Print a response for each query in a separate line.

Idx	Name	Rating
A	Black-and-White Cube	1600
B	Tournament-graph	2200
C	Two permutations	2400

Testing Round 7