def max_sum(arr, n):
    # increasing[i] = max sum of bitonic subsequence ending at i (increasing part)
    increasing = arr[:]
    for i in range(1, n):
        for j in range(i):
            if arr[j] < arr[i]:
                increasing[i] = max(increasing[i], increasing[j] + arr[i])
    
    # decreasing[i] = max sum of bitonic subsequence starting at i (decreasing part)
    decreasing = arr[:]
    for i in range(n - 2, -1, -1):
        for j in range(i + 1, n):
            if arr[j] < arr[i]:
                decreasing[i] = max(decreasing[i], decreasing[j] + arr[i])
    
    # A bitonic subsequence has a peak; combine increasing and decreasing at each peak
    # Subtract arr[i] once since it's counted in both
    result = 0
    for i in range(n):
        result = max(result, increasing[i] + decreasing[i] - arr[i])
    
    return result