#include <fstream>
#include <algorithm>
using namespace std;
int v[100001];
int main()
{ int n,i,Min,sol=0;
    ifstream f("avioane.in");
    ofstream g("avioane.out");
    f>>n;
    for (i=1;i<=n;++i)
        f>>v[i];
    sort(v+1,v+n+1);
    Min=v[1];
    for (i=1;i<=n;++i)
       sol=max(Min*(i-1)+v[i]*(n-i+1),sol);
    g<<sol;
    return 0;
}