Time limit: 1 second

Annie has two favourite baseball teams: the Swifts and the
Semaphores. She has followed them throughout the season, which is now
over. The season lasted for \(N\) days.
Both teams played exactly one game on each day.

For each day, Annie recorded the number of runs scored by the Swifts
on that day. She also recorded this information for the Semaphores.

She would like you to determine the largest integer \(K\) such that \(K \leq N\) and the Swifts and the Semaphores had scored the same
total number of runs \(K\) days after
the start of the season. The total number of runs scored by a team after
\(K\) days is the sum of the number of
runs scored by the team in all games before or on the \(K\)-th day.

For example, if the Swifts and the Semaphores have the same total
number of runs at the end of the season, then you should output \(N\). If the Swifts and the Semaphores never
had the same number of runs after \(K\)
games, for any value of \(K \leq N\),
then output 0.

\(K \leq N\)
\((1 \leq N \leq 100\ 000)\)
\(N \leq 1000\)

The first line of
input will contain an integer \(N\)
\((1 \leq N \leq 100\ 000)\). The
second line will contain \(N\)
space-separated non-negative integers representing the number of runs
scored by the Swifts on each day, in order. The third line will contain
\(N\) space-separated non-negative
integers representing the number of runs scored by the Semaphores on
each day, in order. You may assume that each team scored at most 20 runs
in any single game.

For 7 of the 15 points available, \(N \leq 1000\).

Output the largest integer \(K\)
such that \(K \leq N\) and the Swifts
and the Semaphores have the same total number of runs after \(K\) days.

생성자가 기록되지 않았습니다.

출처 CCC 2017 Senior