#!/usr/bin/env python3
import sys
import heapq


def solve(N: int, A: "List[int]"):
    res = 0

    heap = []
    for i in range(N):
        for j in range(N):
            ureshi = A[i] * abs(i - j)
            heapq.heappush(heap, (-ureshi, i, j))

    usedi = set()
    usedj = set()
    while heap:
        ureshi, i, j = heapq.heappop(heap)
        if i in usedi or j in usedj:
            continue
        usedi.add(i)
        usedj.add(j)
        res += -ureshi

    print(res)


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, A)


if __name__ == '__main__':
    main()
