#include <stdio.h>
#include <algorithm>
#define NMAX 100005
#define ll long long
using namespace std;
int n,A[NMAX];
ll B[NMAX],act,rez;
int main()
{
	freopen("avioane.in","r",stdin);
	freopen("avioane.out","w",stdout);
	scanf("%d",&n);
	int i,j;
	for (i=1; i<=n; i++)
		scanf("%d",&A[i]);
	sort(A+1,A+n+1);
	for (i=1; i<=n; i++)
		for (j=i+1; j<=n; j++)
		{
			act=(ll)A[i]*(j-i)+(ll)A[j]*(n-j+1);
			if (act>rez)
				rez=act;
		}
	printf("%lld\n",rez);
	return 0;
}