using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

internal partial class Solver {

    public void Run() {
        var n = ni();
        var a = ni(n);
        var perm = E.Range(0, n).OrderByDescending(i => a[i]).ToArray();
        var memo = new long?[n + 1, n + 1];

        long dfs(int begin, int end, int pos) {
            if (pos == n) return 0;
            if (!memo[begin, end].HasValue) {
                long val = 0;
                var p = perm[pos];
                val = Math.Max(val, dfs(begin + 1, end, pos + 1) + 1L * Math.Abs(p - begin) * a[p]);
                val = Math.Max(val, dfs(begin, end - 1, pos + 1) + 1L * Math.Abs(p - (end - 1)) * a[p]);
                memo[begin, end] = val;
            }
            return memo[begin, end].Value;
        }

        cout.WriteLine(dfs(0, n, 0));
    }
}

public class Binomial {
    private readonly long[] factorial;
    private readonly long[] inverseFactorial;
    private readonly long[] inverse;
    private readonly int mod;

    public Binomial(int size, int primeMod) {
        size++;
        factorial = new long[size];
        inverseFactorial = new long[size];
        inverse = new long[size];
        mod = primeMod;
        Setup(size);
    }

    private void Setup(int size) {
        factorial[0] = factorial[1] = 1;
        inverseFactorial[0] = inverseFactorial[1] = 1;
        inverse[1] = 1;
        for (int i = 2; i < size; i++) {
            factorial[i] = factorial[i - 1] * i % mod;
            inverse[i] = (mod - (mod / i) * inverse[mod % i] % mod);
            inverseFactorial[i] = inverseFactorial[i - 1] * inverse[i] % mod;
        }
    }

    private long C(int s, int t) {
        if (s < 0 || t < 0 || s < t) {
            return 0;
        }

        if (t == 0 || s == t) {
            return 1;
        }

        if (s >= mod) {
            return C(s % mod, t % mod) * C(s / mod, t / mod) % mod; // Lucas' theorem
        }

        return factorial[s] * inverseFactorial[t] % mod * inverseFactorial[s - t] % mod;
    }

    public long this[int s, int t] {
        get {
            return C(s, t);
        }
    }

    public long P(int s, int t) {
        if (s < 0 || t < 0 || s < t) return 0;
        return factorial[s] * inverseFactorial[s - t] % mod;
    }

    /// <summary>
    /// s 種類のものから重複を許して t 個選ぶ場合の数
    /// </summary>
    public long H(int s, int t) {
        if (s < 0 || t < 0) return 0;
        if (s == 0 && t == 0) return 1;
        return C(s + t - 1, t);
    }

    public long H1(int s, int t) {
        return H(s - t, t);
    }
}
// PREWRITEN CODE BEGINS FROM HERE
internal partial class Solver : Scanner {
    public static void Main(string[] args) {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

internal static class LinqPadExtension {
    [Conditional("DEBUG")]
    public static void Dump<T>(this T obj) {
#if DEBUG
        LINQPad.Extensions.Dump(obj);
#endif
    }
}

public class Scanner {
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (TokenQueue.Count == 0) {
            if (!StockTokens()) {
                throw new InvalidOperationException();
            }
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext() {
        if (TokenQueue.Count > 0) {
            return true;
        }

        return StockTokens();
    }

    private static readonly char[] _separator = new[] { ' ', '\t' };
    private bool StockTokens() {
        while (true) {
            string line = Reader.ReadLine();
            if (line == null) {
                return false;
            }

            string[] tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) {
                continue;
            }

            foreach (string token in tokens) {
                TokenQueue.Enqueue(token);
            }

            return true;
        }
    }
}


Measured memory_bytes: 58352