B'Jeevan has two arrays a and b of size n . He is fond of performing weird operations on arrays. This time, he comes up with two types of operations: He wants to convert array a into an array b using the minimum total number of operations. However, Jeevan seems to have forgotten the value of b_1 . So he makes some guesses. He will ask you q questions corresponding to his q guesses, the i -th of which is of the form: Help him by answering each question. The first line contains a single integer n (1 <= n <= 2 cdot 10^{5}) -- the size of arrays a and b . The second line contains n integers a_1, a_2, ..., a_n (1 <= a_i <= 10^6) . The third line contains n integers b_1, b_2, ..., b_n (1 <= b_i <= 10^6 for i neq 1 ; b_1 = -1 , representing that the value of b_1 is unknown ) . The fourth line contains a single integer q (1 <= q <= 2 cdot 10^{5}) -- the number of questions. Each of the following q lines contains a single integer x_i (1 <= x_i <= 10^6) -- representing the i -th question. Output q integers -- the answers to each of his q questions. Consider the first test case. [3, 7] xrightarrow[ text{decrease}]{ text{i = 1}} [2, 6] xrightarrow[ text{decrease}]{ text{i = 1}} [1, 5] Hence the answer is 2 . [3, 7] xrightarrow[ text{decrease}]{ text{i = 2}} [3, 6] xrightarrow[ text{decrease}]{ text{i = 2}} [3, 5] xrightarrow[ text{increase}]{ text{i = 1}} [4, 6] xrightarrow[ text{decrease}]{ text{i = 2}} [4, 5] Hence the answer is 4 . [3, 7] xrightarrow[ text{decrease}]{ text{i = 2}} [3, 6] xrightarrow[ text{decrease}]{ text{i = 2}} [3, 5] Hence the answer is 2 . '...