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())
li = []

for n in range(2):
  li.append(list(map(int,input().split())))

max = 0

for x in range(N):
  now = 0
  for y in range(x):
    now += li[0][y]

  for y in range(N - x):
    now += li[0][y]
    
  now += li[1][N-1]

  if max < now:
    max = now

print(max)
N=int(input())
li = []

for n in range(2):
  li.append(list(map(int,input().split())))

max = 0

for x in range(N):
  now = 0
  
  for y in range(x + 1):
    now += li[0][y]

  for y in range(N):
    if y < x:
      continue
    now += li[1][y]

  if max < now:
    max = now

print(max)