#include<fstream>
#include<algorithm>
using namespace std;
long long a[100005],i,p1,p2,sol,n,j;

int main(void) {
    ifstream fin("avioane.in");
    ofstream fout("avioane.out");
    
    fin>>n;
    for (i=1; i<=n; ++i) fin>>a[i];
    sort(a+1,a+n+1);
    
    for (i=1; i<n; ++i)
     for (j=i+1; j<=n; ++j)
      sol=max(sol,a[j]*(n-j+1)+(j-i)*a[i]);
   
    /*p1=n; p2=n;
    
    while (p2>=1) {
          while ( (p2-p1)*a[p1]<(p2-p1+1)*a[p1-1]&&p1>0 ) --p1;
          sol=max(sol,a[p2]*(n-p2+1)+a[p1]*(p2-p1) );
          --p2;
          }*/
    
    fout<<sol;
    
    return 0;
}