{"raw_statement":[{"iden":"problem statement","content":"There are $N$ positive integers arranged in a circle.\nNow, 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:\n\n*   Choose an integer $i$ such that $1 \\leq i \\leq N$.\n*   Let $a, b, c$ be the $(i-1)$\\-th, $i$\\-th, and $(i+1)$\\-th numbers, respectively. Replace the $i$\\-th number with $a+b+c$.\n\nHere the $0$\\-th number is the $N$\\-th number, and the $(N+1)$\\-th number is the $1$\\-st number.\nDetermine if Takahashi can achieve his objective. If the answer is yes, find the minimum number of operations required."},{"iden":"constraints","content":"*   $3 \\leq N \\leq 2 \\times 10^5$\n*   $1 \\leq A_i, B_i \\leq 10^9$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $A_2$ $...$ $A_N$\n$B_1$ $B_2$ $...$ $B_N$"},{"iden":"sample input 1","content":"3\n1 1 1\n13 5 7"},{"iden":"sample output 1","content":"4\n\nTakahashi can achieve his objective by, for example, performing the following operations:\n\n*   Replace the second number with $3$.\n*   Replace the second number with $5$.\n*   Replace the third number with $7$.\n*   Replace the first number with $13$."},{"iden":"sample input 2","content":"4\n1 2 3 4\n2 3 4 5"},{"iden":"sample output 2","content":"\\-1"},{"iden":"sample input 3","content":"5\n5 6 5 2 1\n9817 1108 6890 4343 8704"},{"iden":"sample output 3","content":"25"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}