#include <stdio.h>
#include <algorithm>
#define NMAX 100005
#define ll long long
using namespace std;
int n,A[NMAX];
ll B[NMAX],act,rez;
inline ll max(ll x,ll y)
{
	return x>y ? x : y;
}
inline ll value(int dr,int st)
{
	return (ll)A[st]*(dr-st+1);
}
void rezolva(int dr)
{
	int i,a,b;
	a=dr/2-50; b=dr/2+50;
	if (a<=0)
		a=1;
	if (b>dr)
		b=dr;
	for (i=a; i<=b; i++)
		B[dr]=max(B[dr],value(dr,i));
}
int main()
{
	freopen("avioane.in","r",stdin);
	freopen("avioane.out","w",stdout);
	scanf("%d",&n);
	int i;
	for (i=1; i<=n; i++)
		scanf("%d",&A[i]);
	sort(A+1,A+n+1);
	for (i=1; i<=n; i++)
		rezolva(i);
	for (i=1; i<=n; i++)
	{
		act=B[i-1]+(ll)A[i]*(n-i+1);
		if (act>rez)
			rez=act;
	}
	printf("%lld\n",rez);
	return 0;
}