#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("avioane.in");
ofstream g ("avioane.out");
long long n,v[100005],i,m,Max,Max2,s,j,a,b;
int main()
{
    f>>n;
    for (i=1;i<=n;i++)
        f>>v[i];
    sort(v+1,v+n+1);
    for (i=2;i<=n;i++)
    {
        Max=v[i]*(n-i+1);
        a=i;
        Max2=0;
        for (j=1;j<i;j++)
        {
            if (Max2<v[j]*(i-j)) Max2=v[j]*(i-j),b=j;
        }
        if (Max+Max2>s) s=Max+Max2;
    }
    g<<s;
    return 0;
}