CF1036D.Vasya and Arrays

Vasya has two arrays $A$ and $B$ of lengths $n$ and $m$, respectively.

He can perform the following operation arbitrary number of times (possibly zero): he takes some consecutive subsegment of the array and replaces it with a single element, equal to the sum of all elements on this subsegment. For example, from the array $[1, 10, 100, 1000, 10000]$ Vasya can obtain array $[1, 1110, 10000]$, and from array $[1, 2, 3]$ Vasya can obtain array $[6]$.

Two arrays $A$ and $B$ are considered equal if and only if they have the same length and for each valid $i$ $A_i = B_i$.

Vasya wants to perform some of these operations on array $A$, some on array $B$, in such a way that arrays $A$ and $B$ become equal. Moreover, the lengths of the resulting arrays should be maximal possible.

Help Vasya to determine the maximum length of the arrays that he can achieve or output that it is impossible to make arrays $A$ and $B$ equal.

瓦西里有两个长度分别为 $n$ 和 $m$ 的数组 $A$ 和 $B$。

他可以任意多次（包括零次）执行如下操作：选取数组中某个连续子段，并将其替换为一个元素，该元素的值等于该子段中所有元素之和。例如，从数组 $[1, 10, 100, 1000, 10000]$ 出发，瓦西里可以得到数组 $[1, 1110, 10000]$；从数组 $[1, 2, 3]$ 出发，他可以得到数组 $[6]$。

当且仅当两个数组长度相同，且对每个合法下标 $i$ 均有 $A_i = B_i$ 时，称数组 $A$ 和 $B$ 相等。

瓦西里希望对数组 $A$ 执行若干次上述操作，对数组 $B$ 也执行若干次上述操作，使得最终两个数组相等。此外，要求最终数组的长度尽可能大。

请帮助瓦西里确定所能达到的最大数组长度；若无法使数组 $A$ 和 $B$ 相等，则输出不可能。

The first line contains a single integer $n~(1 \le n \le 3 \cdot 10^5)$ — the length of the first array.

The second line contains $n$ integers $a_1, a_2, \cdots, a_n~(1 \le a_i \le 10^9)$ — elements of the array $A$.

The third line contains a single integer $m~(1 \le m \le 3 \cdot 10^5)$ — the length of the second array.

The fourth line contains $m$ integers $b_1, b_2, \cdots, b_m~(1 \le b_i \le 10^9)$ - elements of the array $B$.

第一行包含一个整数 $n~(1 \le n \le 3 \cdot 10^5)$ —— 第一个数组的长度。

第二行包含 $n$ 个整数 $a_1, a_2, \cdots, a_n~(1 \le a_i \le 10^9)$ —— 数组 $A$ 的元素。

第三行包含一个整数 $m~(1 \le m \le 3 \cdot 10^5)$ —— 第二个数组的长度。

第四行包含 $m$ 个整数 $b_1, b_2, \cdots, b_m~(1 \le b_i \le 10^9)$ —— 数组 $B$ 的元素。

Print a single integer — the maximum length of the resulting arrays after some operations were performed on arrays $A$ and $B$ in such a way that they became equal.

If there is no way to make array equal, print "-1".

输出一个整数——在对数组 $A$ 和 $B$ 执行若干操作后，使其相等的情况下，所得数组的最大长度。

若无法使两个数组相等，则输出 -1。