#include<stdio.h>
#include <algorithm>
using namespace std;
int i,j,e,b,maxim,p1,p2,n,a[100001],aux,s=0;
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] && a[j]!=a[j-1]){
				e=a[i]*(j-i);
				b=a[j]*(n-j+1);
				if(e+b>s) s=e+b;
			}
		}
			
	printf("%d", s);
	return 0;
}