====== Simple Game ======

===== 풀이 =====
  * {{myicon>p5}} [[ps:problems:boj:31027]]와 동일한 세팅의 문제이다. 풀이는 그쪽을 참고.

===== 코드 =====
<dkpr py>
"""Solution code for "BOJ 33392. Simple Game".

- Problem link: https://www.acmicpc.net/problem/33392
- Solution link: http://www.teferi.net/ps/problems/boj/33392

Tags: [game theory]
"""

import sys
from teflib import psutils


@psutils.run_n_times
def main():
    n = int(sys.stdin.readline())
    a1 = [int(x) for x in sys.stdin.readline().split()]
    a2 = [int(x) for x in sys.stdin.readline().split()]

    if n % 2 == 1:
        score1 = sum(a1[: n // 2]) + sum(a2[: n // 2])
        score2 = min(sum(a1), score1 + a1[n // 2] + a2[n // 2])
        print(max(score1, score2))
    else:
        score1 = sum(a1[: n // 2]) + sum(a2[: n // 2])
        score2a = max(score1, sum(a1))
        score2b = score1 + a1[n // 2] + a2[n // 2]
        score2 = min(score2a, score2b)
        print(max(score1, score2))


if __name__ == '__main__':
    main()

</dkpr>

{{tag>BOJ ps:problems:boj:플래티넘_5}}