#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

int a[111111],b[111111];

int main()
{
    long long n,i,j,s1=0,s2=0,maxim,k;
    in>>n;
    for(i=1;i<=n;++i)
    {
        in>>a[i];
    }
    sort(a+1,a+n+1);
    //b[n]=a[n];
    //maxim=a[n];
    //max=n;
    //for(i=n-1;i>0;i--) b[i]=a[i]*(n+1-i);
    maxim=a[n-1]+a[n];
    for(i=n-2;i>0;i--)
        for(j=i+1;j<=n;j++)
        {
            k=a[i]*(j-i)+a[j]*(n+1-j);
            if(k>maxim) maxim=k;
        }
    out<<maxim;
    return 0;
}