#include<stdio.h>
#include <algorithm>
using namespace std;
int i,j,n,a[100001],aux,s=0,l;
int main(){
	freopen("avioane.in","r",stdin);
	freopen("avioane.out","w",stdout);
	scanf("%d", &n);
	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){
			if(a[i]==a[i-1]){ i++; j--; continue;}
			//if(a[j]==a[j-1]) continue;
				l=a[i]*(j-i)+a[j]*(n-j+1);
				if(l>s) s=l;
		}
	printf("%d", s);
	return 0;
}