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

    # Part 1: Calculate maximum sum of increasing subsequences ending at each index
    # increasing_sums[i] stores the maximum sum of a strictly increasing
    # subsequence that ends with arr[i].
    increasing_sums = list(arr)
    for i in range(1, n):
        for j in range(i):
            if arr[i] > arr[j]:
                increasing_sums[i] = max(increasing_sums[i], increasing_sums[j] + arr[i])

    # Part 2: Calculate maximum sum of decreasing subsequences starting at each index
    # decreasing_sums[i] stores the maximum sum of a strictly decreasing
    # subsequence that starts with arr[i].
    decreasing_sums = list(arr)
    for i in range(n - 2, -1, -1):
        for j in range(n - 1, i, -1):
            if arr[i] > arr[j]:
                decreasing_sums[i] = max(decreasing_sums[i], decreasing_sums[j] + arr[i])

    # Part 3: Find the maximum bi-tonic sum
    # A bi-tonic sequence with a peak at arr[i] has a sum of:
    # (increasing part sum) + (decreasing part sum) - (peak value, as it's in both)
    max_bitonic_sum = float('-inf')
    for i in range(n):
        current_sum = increasing_sums[i] + decreasing_sums[i] - arr[i]
        max_bitonic_sum = max(max_bitonic_sum, current_sum)

    return max_bitonic_sum
```