#include <cstdio>
#include<algorithm>
using namespace std;
long long j,s,n,i,a[100000];
int main()
{
    freopen("avioane.in","r",stdin);
    freopen("avioane.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%lld",&a[i]);
    sort(a,a+1+n);
    for(i=n;i>1;i--)
    {
        for(j=i-1;j>=1;j--)
            if(a[i]*(n-i+1)+a[j]*(i-j)>s)s=a[i]*(n-i+1)+a[j]*(i-j);
    }
    printf("%lld",s);
    return 0;
}