local mmi, mma = math.min, math.max
local mab = math.abs
local n = io.read("*n")
local t = {}
for i = 1, n do
  t[i] = {io.read("*n")}
  t[i][2] = i
end
table.sort(t, function(a, b) return a[1] > b[1] end)
local dp = {}
for i = 1, n do
  local val, idx = t[i][1], t[i][2]
  dp[i] = {}
  for j = 1, i + 1 do
    -- j: left use count - 1
    dp[i][j] = 0
  end
  if i == 1 then
    dp[i][1] = val * (n - idx)
    dp[i][2] = val * (idx - 1)
  else
    for j = 1, i do
      -- dst: j
      dp[i][j + 1] = mma(dp[i][j + 1], dp[i - 1][j] + val * mab(idx - j))
      -- dst: n - (i - (j - 1)) + 1
      dp[i][j] = mma(dp[i][j], dp[i - 1][j] + val * mab(n - i + j - idx))
    end
  end
  -- print(table.concat(dp[i], " "))
end
local ret = 0
for i = 1, n + 1 do
  ret = mma(ret, dp[n][i])
end
print(ret)
