We have a 2 \times N grid. We will denote the square at the i-th row and j-th column (1 \leq i \leq 2, 1 \leq j \leq N) as (i, j).  You are initially in the top-left square, (1, 1). You will travel to the bottom-right square, (2, N), by repeatedly moving right or down.  The square (i, j) contains A_{i, j} candies. You will collect all the candies you visit during the travel. The top-left and bottom-right squares also contain candies, and you will also collect them.  At most how many candies can you collect when you choose the best way to travel?
N = int(input())
A = list(int(i) for i in input().split())
B = list(int(i) for i in input().split())
result = 0

if N == 1:
    result = A[0] + B[0]
else:
    for i in range(N-1):
        print(A[:i+1])
        print(B[i:])
        result = max(result, sum(A[:i+1]) + sum(B[i:]))

print(result)
N = int(input())
A = list(int(i) for i in input().split())
B = list(int(i) for i in input().split())
result = 0

if N == 1:
    result = A[0] + B[0]
else:
    for i in range(N-1):
        result = max(result, sum(A[:i+1]) + sum(B[i:]))

print(result)