#include<cstdio>
#include<algorithm>
using namespace std;
int n,i,j,p,q,nr,m;
int v[100005];
long long maxx,s;
int main()
{
    freopen("avioane.in","r",stdin);
    freopen("avioane.out","w",stdout);
    scanf("%d",&n);
    for (i=1;i<=n;i++) scanf("%d",&v[i]),s=s+v[i]*1LL;
    sort(v+1,v+n+1);
    p=v[n/2-1];
    for (j=1;j<n;j++)
    for (i=j+1;i<=n;i++) if ((v[i]*(n-i+1)*1LL)+((i-j)*v[j]*1LL)>maxx)
    {
        maxx=(v[i]*(n-i+1)*1LL)+((i-j)*v[j]*1LL);
    }
    printf("%lld",maxx);
}