#include <fstream>
#include <algorithm>
using namespace std;

const int N=100002;
int v[N],n,rez=-1;

ifstream in("avioane.in");
ofstream out("avioane.out");

inline int val(int x,int y)
{
    return v[y]*(n-y+1)+v[x]*(y-x);
}

inline int max(int a,int b)
{
    return a>b ? a : b;
}

int main()
{
    in>>n;
    for (int i=1;i<=n;i++)
        in>>v[i];
    sort(v+1,v+n+1);
    for (int i=1,q=0;i<n && q<=10000000;i++,q+=n)
        for (int j=i+1;j<=n;j++)
            rez=max(rez,val(i,j));
    out<<rez<<"\n";
    return 0;
}