#include <stdio.h>
#include <algorithm>

using namespace std;

int n,maxx,s,i,ind,v[100010];

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]);
    sort(v+1,v+n+1);
    for (i=1;i<=n;++i)
        if (v[i]*(n-i+1)>maxx)
        {
            maxx=v[i]*(n-i+1);
            ind=i;
        }
    s+=maxx;
    maxx/=(n-ind+1);
    for (i=ind;i<=n;++i)
        v[i]-=maxx;
    maxx=0;
    for (i=ind;i<=n;++i)
        if (v[i]*(n-i+1)>maxx)
            maxx=v[i]*(n-i+1);
    for (i=1;i<ind;++i)
        if (v[i]*(ind-i)>maxx)
            maxx=v[i]*(ind-i);
    s+=maxx;
    printf("%d",s);
    return 0;
}