Let a and b be two integer arrays. Your task is to find two values L and R (1 ≤ L ≤ R ≤ N) such that:
We are only interested in the size of the resulting sequence. If there are multiple solutions, only the largest is taken into account. If there is no solution, the answer is 0.
Input
The first line of input contains integer N, the number of elements in each array.
The second line of input contains integers a1, a2, …, aN.
The third line of input contains integers b1, b2, …, bN.
Output
The output should contain a single integer: the largest size of a valid sequence.
Constraints
- 1 ≤ N ≤ 105
- 0 ≤ ai, bi < 231
Sample
| Input | Output | Explanation |
|---|---|---|
| 5 1 2 3 4 5 5 4 3 2 1 | 5 | We can choose L = 1 and R = N, and obtain the sum 15 in both arrays. An alternative solution is L = R = 3, but this sequence is smaller. |
