Score : 800 points
There are N positive integers arranged in a circle.
Now, the i-th number is A_i. Takahashi wants the i-th number to be B_i. For this objective, he will repeatedly perform the following operation:
Here the 0-th number is the N-th number, and the (N+1)-th number is the 1-st number.
Determine if Takahashi can achieve his objective. If the answer is yes, find the minimum number of operations required.
Input is given from Standard Input in the following format:
N A_1 A_2 ... A_N B_1 B_2 ... B_N
Print the minimum number of operations required, or -1
if the objective cannot be achieved.
3 1 1 1 13 5 7
4
Takahashi can achieve his objective by, for example, performing the following operations:
4 1 2 3 4 2 3 4 5
-1
5 5 6 5 2 1 9817 1108 6890 4343 8704
25