def max_sum(arr, n):
    inc = [0] * n
    dec = [0] * n
    
    for i in range(n):
        inc[i] = arr[i]
        for j in range(i):
            if arr[j] < arr[i]:
                inc[i] = max(inc[i], inc[j] + arr[i])
    
    for i in range(n-1, -1, -1):
        dec[i] = arr[i]
        for j in range(i+1, n):
            if arr[j] < arr[i]:
                dec[i] = max(dec[i], dec[j] + arr[i])
    
    max_sum_val = 0
    for i in range(n):
        max_sum_val = max(max_sum_val, inc[i] + dec[i] - arr[i])
    
    return max_sum_val