def max_sum(arr, n):
    if n == 0:
        return 0

    inc_sum = arr[:]
    for i in range(n):
        for j in range(i):
            if arr[j] < arr[i]:
                candidate = inc_sum[j] + arr[i]
                if candidate > inc_sum[i]:
                    inc_sum[i] = candidate

    dec_sum = arr[:]
    for i in range(n - 1, -1, -1):
        for j in range(n - 1, i, -1):
            if arr[j] < arr[i]:
                candidate = dec_sum[j] + arr[i]
                if candidate > dec_sum[i]:
                    dec_sum[i] = candidate

    best = 0
    for i in range(n):
        total = inc_sum[i] + dec_sum[i] - arr[i]
        if total > best:
            best = total

    return best