//Lambru Andrei Cristian - Algoridmiada 2011
//Runda Finala - Clasele 5-9
#include<stdio.h>
#include<algorithm>
using namespace std;

long int A[100001];
int N;
unsigned long long MAX;

int main()
{
	FILE *f = fopen("avioane.in","r");
	FILE *g = fopen("avioane.out","w");
	
	fscanf(f,"%d",&N);
	for(int i=1;i<=N;i++)
		fscanf(f,"%d",&A[i]);
	sort(A+1,A+N+1);
	for(int i=1;i<=N;i++)
		if(A[i] != A[i-1])
		for(int j=1;i-j;j++)
			if(MAX<A[i]*(N-i+1) + A[j]*(i-j))
				MAX = A[i]*(N-i+1) + A[j]*(i-j);
	fprintf(g,"%llu",MAX);
//	for(int i=1;i<=N;i++)
//		printf("%d\n",A[i]);
	
	fclose(g);
	fclose(f);
	return 0;
}