#include<cstdio>
#include<algorithm>
using std::sort;
int v[100005];
int main(){
    freopen("avioane.in","r",stdin);
    freopen("avioane.out","w",stdout);
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        scanf("%d",v+i);
    sort(v,v+n);
    //for(int i=0;i<n;i++)printf("%d ",v[i]);
    //printf("\n");
    /*
    int s=0,ms=0;
    for(int b=1;b<n;b++)
        for(int e=0;e<b;e++){
            s=(b-e)*v[e]+(n-b)*v[b];
            ms=s>ms?s:ms;
            if(s==129)
                printf("%d %d\n",e,b);
        }
    */
    int s,ms1=0,ms=0,me;
    for(int e=1;e<n;e++){
        s=(n-e)*v[e];
        if(s>ms1)ms1=s,me=e;
    }
    for(int b=me+1;b<n;b++){
        s=(n-b)*v[b]+(b-me)*v[me];
        ms=s>ms?s:ms;
    }
    printf("%d",ms);
    return 0;
}