Maxwell has a chocolate bar that he wants to share with his friends. The chocolate bar can be represented as a $2$ by $N$ array of integers $T_{i,j}$, the tastiness of each square. Maxwell would like to split the entire chocolate bar into connected parts such that the average (mean) tastiness of the chocolate bar is the same for each part. Maxwell would like to know what is the maximum number of connected parts he can split his chocolate bar into as described above.
A part is considered connected if you can visit every cell by moving up, down, left or right.

The first line of input will consist of one positive integer $N$, representing the length of the chocolate bar.
The second line of input contains $N$ spaced integers representing the top row of the chocolate bar where the $j^{th}$ integer from the left represents $T_{1,j}$.
Similarly, the third line of input contains $N$ spaced integers representing the bottom row of the chocolate bar where the $j^{th}$ integer from the left represents $T_{2,j}$.

Output a single integer, representing the maximum number of connected parts Maxwell can split his chocolate bar into.

$1 \leq N \leq 200,000$
$0 \leq T_{i,j} \leq 100,000,000$

2

An example of how to split this chocolate bar optimally into 2 parts is to have the bottom right corner as its own part and the rest of the chocolate as the second part, as shown below.

Each piece will have an average tastiness of 5.

5

One way to get the optimal split is shown in the following picture:

Note that each piece has an average tastiness of 1.