#include<cstdio>
#include<algorithm>
using namespace std;
int n,i,j,ras,ras1,ma,k,a[100004],s[100004];
double l[100004];
double inter(int x, int y)
{
    return (double) ((1-x)*a[x] + (1-y)*a[y]) / (a[y]-a[x]);
}
int main()
{
    freopen("avioane.in","r",stdin);
    freopen("avioane.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d",&a[i]);
    sort(a+1,a+n+1);

    for(i=2;i<=n;i++)
    {
        ras=a[i]*(n-i+1);
        for(j=1;j<i;j++)
        {
            ras1=ras+a[j]*(i-j);
            if(ras1>ma)
                ma=ras1;
        }
    }
    printf("%d\n",ma);
    /*
    l[1]=0;
    s[1]=1;
    k=1;
    for(i=2;i<=n;i++)
    {
        if(a[i]!=a[i-1])
        {
            while(k&&inter(i,s[k])<=l[k])
            {
                l[k]=0;
                k--;
            }
            k++;
            l[k]=inter(i,s[k-1]);
            s[k]=i;
        }
    }
    for(i=1;i<=k;i++)
        printf("%lf ",l[i]);
    */
    return 0;
}