// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    pass

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(fromStartMaxEnding[i-1], fromStartMaxEnding[i-1]+A[i])
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(fromEndMaxEnding[i+1], fromEndMaxEnding[i+1]+A[i])
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(fromStartMaxEnding[i-1], fromStartMaxEnding[i-1]+A[i])
        print
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(fromEndMaxEnding[i+1], fromEndMaxEnding[i+1]+A[i])
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(fromStartMaxEnding[i-1], fromStartMaxEnding[i-1]+A[i])
        print()
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(fromEndMaxEnding[i+1], fromEndMaxEnding[i+1]+A[i])
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(fromStartMaxEnding[i-1], fromStartMaxEnding[i-1]+A[i])
        print(fromStartMaxEnding[i])
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(fromEndMaxEnding[i+1], fromEndMaxEnding[i+1]+A[i])
        print()
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(fromStartMaxEnding[i-1], fromStartMaxEnding[i-1]+A[i])
        print(fromStartMaxEnding[i])
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(fromEndMaxEnding[i+1], fromEndMaxEnding[i+1]+A[i])
        print(fromEndMaxEnding[i])
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(fromStartMaxEnding[i-1], fromStartMaxEnding[i-1]+A[i])
        print(fromStartMaxEnding[i])
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(fromEndMaxEnding[i+1], fromEndMaxEnding[i+1]+A[i])
        print(fromEndMaxEnding[i])
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(fromStartMaxEnding[i-1], fromStartMaxEnding[i-1]+A[i])
        print(fromStartMaxEnding[i])
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(fromEndMaxEnding[i+1], fromEndMaxEnding[i+1]+A[i])
        print(fromEndMaxEnding[i])
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(fromStartMaxEnding[i-1], fromStartMaxEnding[i-1]+A[i])
        print(fromStartMaxEnding[i])
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(0, fromEndMaxEnding[i+1]+A[i])
        print(fromEndMaxEnding[i])
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(0, fromStartMaxEnding[i-1]+A[i])
        print(fromStartMaxEnding[i])
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(0, fromEndMaxEnding[i+1]+A[i])
        print(fromEndMaxEnding[i])
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(0, fromStartMaxEnding[i-1]+A[i])
        print(fromStartMaxEnding[i])
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(0, fromEndMaxEnding[i+1]+A[i])
        print(fromEndMaxEnding[i])
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(0, fromStartMaxEnding[i-1]+A[i])
        print(fromStartMaxEnding[i])
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(0, fromEndMaxEnding[i+1]+A[i])
    
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(0, fromStartMaxEnding[i-1]+A[i])
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(0, fromEndMaxEnding[i+1]+A[i])
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(0, fromStartMaxEnding[i-1]+A[i])
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(0, fromEndMaxEnding[i+1]+A[i])
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    
    fromStartMaxEnding = [0] * len(A)

    for i in range(1, len(A)-1):
        fromStartMaxEnding[i] = max(0, fromStartMaxEnding[i-1]+A[i])
    
    fromEndMaxEnding = [0] * len(A)
    
    for i in range(len(A)-2, 0, -1):
        fromEndMaxEnding[i] = max(0, fromEndMaxEnding[i+1]+A[i])
    
    ans = -1 * 2**23
    for i in range(1, len(A)-1):
        ans = max(ans, fromStartMaxEnding[i-1] + fromEndMaxEnding[i+1])
    
    return ans