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

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

int n,a[100001],i,s,maxs,j;

int main () {
    f >> n;
    for (i=1;i<=n;i++) f >> a[i];
    sort(a+1,a+n+1);
    for (i=1;i<=n;i++)
        for (j=i+1;j<=n;j++) {
            s=(j-i)*a[i];
            s=s+(n-j+1)*a[j];
            if (maxs<s) maxs=s;
        }
    g << maxs << '\n';
    f.close();g.close();
    return 0;
}