#include <bits/stdc++.h>

#define INF (1 << 30)
#define LLINF (1LL << 62)
#define mod 666013

using namespace std;

typedef long long LL;

int n, i, j, ok;
LL sol, mx, rez;
int v[100005];

LL ternary(int st, int dr, int val)
{
    if(st > dr)
        return 0;

    if(st == dr)
    {
        return 1LL * (v[st] - val) * (n - st + 1);
    }
    if(st == dr - 1)
    {
        int mij1 = st;
        int mij2 = dr;
        return max(1LL * (v[mij1] - val) * (n - mij1 + 1), 1LL * (v[mij2] - val) * (n - mij2 + 1));
    }

    int mij1 = st + (dr - st) / 3;
    int mij2 = st + ( 2 * (dr - st) ) / 3;

    if( 1LL * (v[mij1] - val) * (n - mij1 + 1) > 1LL * (v[mij2] - val) * (n - mij2 + 1) )
        return max( ternary(st, mij2 - 1, val), 1LL * (v[mij1] - val) * (n - mij1 + 1) );
    else
        return max( ternary(mij1 + 1, dr, val), 1LL * (v[mij2] - val) * (n - mij2 + 1) );
}

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);

    if(n <= 5000)
    {
        rez = 0;
        for(i = 1; i <= n; i++)
        {
            sol = 1LL * v[i] * (n - i + 1);
            mx = 0;
            for(j = i + 1; j <= n; j++)
                mx = max(mx, 1LL * (v[j] - v[i]) * (n - j + 1));
            sol += mx;
            rez = max(rez, sol);
        }
        printf("%lld", rez);
        return 0;
    }

    for(i = 1; i <= n; i++)
    {
        sol = 1LL * v[i] * (n - i + 1);
        sol += ternary(i + 1, n, v[i]);
        mx = max(sol, mx);
    }
    printf("%lld", mx);

    return 0;
}