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

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

long long n,a[100001],i,s,maxs,j,l[100001],w[100001];

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++) {
        s+=a[i];
        l[i]=s-a[i];
        w[i]=(n-i+1)*a[i];
        if (maxs<w[i]) {maxs=w[i];j=i;}
    }
    maxs=0;
    for (i=j+1;i<=n;i++) {
        s=(i-j)*a[j];
        s=s+(n-i+1)*a[i];
        if (maxs<s) maxs=s;
    }
    g << maxs << '\n';
    f.close();g.close();
    return 0;
}