#include <stdio.h>
#include <algorithm>
#define NMAX 100005
#define ll long long
using namespace std;
int n,A[NMAX];
ll B[NMAX],act,rez;
void rezolva(int dr)
{
	int i,step,st=0;
	for (step=1; step<=dr; step<<=1);
	for (i=0; step; step>>=1)
	{
		if (st+step<=dr && B[dr]<(ll)A[st+step]*(dr-st-step+1))
			st+=step,B[dr]=(ll)A[st]*(dr-st+1);
		if (st-step>0 && B[dr]<(ll)A[st-step]*(dr-st+step+1))
			st-=step,B[dr]=(ll)A[st]*(dr-st+1);
	}
}
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;
}