#include <iostream>
#include <fstream>
#include <algorithm>
#include <climits>
using namespace std;

ifstream f("avioane.in");
ofstream g("avioane.out");

int n, v[100001];

int main()
{
    f >> n;
    for (int i = 0; i < n; i ++)
        f >> v[i];
    sort(v, v + n);
    int maxim = INT_MIN;
    for (int i = 0; i < n ; i ++)
        for (int j = i; j < n; j ++)
            if ((j - i) * v[i] + (n - j) * v[j] > maxim)
                maxim = (j - i) * v[i] + (n - j) * v[j];
    g << maxim;
    f.close();
    g.close();
    return 0;
}