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

int n, a[100005], dq[100005], timp[100005];
int main()
{
    freopen("avioane.in", "r", stdin);
    freopen("avioane.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 1; i <= n ; ++i)
        scanf("%d", &a[i]);
    sort(a + 1, a + n + 1);
    long long Sol = 1LL * n * a[1], Back = 0, Front = 1;
    for(int i = 2; i <= n ; ++i){
        long long va = 1LL * a[i] * (n - i + 1);
        int t = 0;
        if(a[i - 1] != a[i - 2]){
            while(Back >= Front){
                t = (-(i - 1) * a[i] + (dq[Back]) * a[dq[Back]]) / (a[dq[Back]] - a[i]);
                if((-(i - 1) * a[i] + (dq[Back]) * a[dq[Back]]) % (a[dq[Back]] - a[i])) ++t;
                if(t > timp[Back]) break ;
                --Back;
            }
            dq[++Back] = i - 1;
            timp[Back] = t;
        }
        while(timp[Front + 1] <= i && Front + 1 <= Back) ++Front;
        va = va + 1LL * a[dq[Front]] * (i - dq[Front]);
        if(va > Sol) Sol = va;
    }
    printf("%lld", Sol);
    return 0;
}