### BUGGY CODE ###

# -*- coding: utf-8 -*-


# 整数の入力
a = int(input())
# スペース区切りの整数の入力
strs = input().split()

# nums = []
only_nums = []
dic = {}
for i in range(a):
    v = int(strs[i])
    v_list = dic.setdefault(v, set([]))
    v_list.add(i)
    only_nums.append(v)

sorted_nums = sorted(only_nums, reverse=True)
# print(sorted_nums)

# print(nums)

# res[x][y]をx人を左から活性度順に並べて、y人を右から活性度順に並べた状態の(スコア最大値, 移動済のindexを記述したリスト)とする
res = []
for i in range(a + 1):
    ls = []
    for j in range(a + 1):
        ls.append((0, set([])))
    res.append(ls)

max_num_changed = True
max_num = sorted_nums[0]
for i in range(a + 1):
    # print("i in range(a)")
    # print(i)
    # print(a)
    # print("i in range(a)")
    if i == 0:
        continue
    if i == 1:
        sorted_nums = sorted_nums[1:]
        # x,y = 0,1にした場合
        max_num_idx_min = min(dic[max_num])
        res[0][1] = (max_num * (a - 1 - max_num_idx_min), {max_num_idx_min})

        # x,y = 1,0にした場合
        max_num_idx_max = max(dic[max_num])
        res[1][0] = (max_num * max_num_idx_max, {max_num_idx_max})

    else:
        target_val = sorted_nums[0]
        sorted_nums = sorted_nums[1:]
        if target_val == max_num:
            max_num_changed = False
        else:
            max_num_changed = True
            max_num = target_val

        # print(sorted_nums)

        score_right = -1
        # x,y = i-j,j(0 ≤ j ≤ i)にした場合を考える
        # i - 1のresについてそれぞれ次の状態を考えていく
        # res[i-1][0], res[i-2][1], res[i-3][2], ... , res[i-1-j][j], ... , res[0][i-1]
        ls_j = []
        for j in range(i):
            if max_num_changed:
                already_used_max_num_index = set([])
                max_num_idx_max = max(dic[max_num])
                max_num_idx_min = min(dic[max_num])
            else:
                already_used_max_num_index = res[i-j-1][j][1]
                tmp_list = dic[max_num] - already_used_max_num_index
                max_num_idx_max = max(tmp_list)
                max_num_idx_min = min(tmp_list)

            # from i-j-1,j to i-j,j (最大活性のものを左に移動)
            score_left = max_num * abs(max_num_idx_max - (i - j - 1)) + res[i - j - 1][j][0]

            # 左端はその値をそのまま利用。右側に移動したものよりも大きい場合はleftの値を設定
            if j == 0 or score_right < score_left:
                res_list = already_used_max_num_index.copy()
                res_list.add(max_num_idx_max)
                res[i - j][j] = (score_left, res_list)

            # from i-j-1,j to i-j-1,j+1 (最大活性のものを右に移動)
            score_right = max_num * abs(a - 1 - max_num_idx_min - j) + res[i - j - 1][j][0]
            # 右側に移動の場合は一旦その値を暫定値として設定してしまう（必要があれば次のループで上書きされるので問題ない）
            res_list = already_used_max_num_index.copy()
            res_list.add(max_num_idx_min)
            res[i - j - 1][j + 1] = (score_right, res_list)

    if i == a:
        result = []
        for j in range(a + 1):
            result.append(res[j][i - j][0])
        # print(result)
        print(max(result))


### FIXED CODE ###

# -*- coding: utf-8 -*-


def main():

    # 整数の入力
    a = int(input())
    # # スペース区切りの整数の入力
    nums = list(map(int, input().split()))

    vilist = []
    for i in range(a):
        vilist.append((nums[i], i))
    vilist = sorted(vilist, key=lambda vi: vi[0])

    # dp[x][y]をx人を左から活性度順に並べて、y人を右から活性度順に並べた状態のスコア最大値とする
    dp = []
    for i in range(a):
        dp.append([0]*(a-i))

    # dp = [[0] * a for i in range(a)]

    # cnt = 0
    # dp[i][j]を考える
    for k in range(a-1):
        vi = vilist.pop()
        v = vi[0]
        p = vi[1]
        vi_z = vilist[0]
        vz = vi_z[0]
        pz = vi_z[1]

        for i in range(k + 2):
            # cnt += 1
            j = k - i + 1
            # if i == 0 and j == 0:
            #     continue

            # 最後の値は場所が特定できるのでそのまま計算させる
            if k == a - 2:
                if j == 0:
                    dp[i][0] = dp[i-1][0] + v * abs(p - i + 1) + vz * abs(pz - i)
                elif i == 0:
                    dp[0][j] = dp[0][j-1] + v * abs(a - j - p) + vz * abs(a - j - 1 - pz)
                else:
                    dp[i][j] = max(dp[i-1][j] + v * abs(p - i + 1) + vz * abs(pz - i),
                                   dp[i][j-1] + v * abs(a - j - p) + vz * abs(pz - i))
            else:
                if j == 0:
                    dp[i][0] = dp[i-1][0] + v * abs(p - i + 1)
                elif i == 0:
                    dp[0][j] = dp[0][j-1] + v * abs(a - j - p)
                else:
                    dp[i][j] = max(dp[i-1][j] + v * abs(p - i + 1),
                                   dp[i][j-1] + v * abs(a - j - p))

    # print(cnt)
    print(max([max(x) for x in dp]))


main()