#include <bits/stdc++.h>
#define maxN 100002
using namespace std;
int n, v[maxN], d[maxN];
long long ans;
void read()
{
    freopen("avioane.in", "r", stdin);
    scanf("%d", &n);
    for (int i = 1; i <= n; ++ i)
        scanf("%d", &v[i]);
    sort(v + 1, v + n + 1);
    d[n + 1] = n;
}
void solve(int l, int r)
{
    if (l > r)
        return ;
    int i, mid = (l + r) >> 1;
    for (i = d[l - 1]; i <= d[r + 1] && i <= mid; ++ i)
        if (1LL * (mid - i + 1) * v[i] > 1LL * (mid - d[mid] + 1) * v[d[mid]])
            d[mid] = i;
    solve(l, mid - 1);
    solve(mid + 1, r);
}
void write()
{
    int i;
    freopen("avioane.out", "w", stdout);
    ans = v[1] * n;
    for (i = 2; i <= n; ++ i)
        if (1LL * (i - d[i - 1]) * v[d[i - 1]] + 1LL * v[i] * (n - i + 1) > ans)
            ans = 1LL * (i - d[i - 1]) * v[d[i - 1]] + 1LL * v[i] * (n - i + 1);

    printf("%lld\n", ans);
}
int main()
{
    read();
    solve(1, n);
    write();
    return 0;
}