题解 | #获得最多的奖金#

while True:
    try:
        n=int(input())
        ls=list(map(int,input().split(' ')))
        left = 0
        right = n-1
        maxum=0
        left_value=ls[0]
        right_value=ls[-1]
        while left < right :
            if left_value == right_value:
                #print(left_value,right_value)
                if maxum < left_value:
                    maxum = left_value
                left+=1
                left_value+=ls[left]
                right-=1
                right_value+=ls[right]
            elif left_value < right_value:
                #print(left_value,right_value)
                left += 1
                if left < n:
                    left_value+=ls[left]
            else:
                #print(left_value,right_value)
                right -= 1
                if right < n:
                    right_value+=ls[right]                
        print(maxum)
    except:
        break