#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 value(int dr,int st)
{
	return (ll)A[st]*(dr-st+1);
}
void rezolva(int dr)
{
	int i,step,st=0;
	for (step=1; step<=dr; step<<=1);
	char ok;
	ll val1,val2;
	for (i=0; step; step>>=1)
	{
		ok=1;
		while (ok)
		{
			ok=0;
			val1=val2=0;
			if (st+step<=dr)
				val1=value(dr,st+step);
			if (st-step>0)
				val2=value(dr,st-step);
			if (val1>val2 && B[dr]<val1)
				B[dr]=val1,st+=step,ok=1;
			if (val2>val1 && B[dr]<val2)
				B[dr]=val2,st-=step,ok=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;
}