#include <stdio.h>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

int main(){
	vector<int> a;int n,x;
	freopen("avioane.in","r",stdin);
	freopen("avioane.out","w",stdout);
	
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&x);a.push_back(x);
	}
	
	sort(a.begin(),a.end());
	long long max=0;
	
	for(int i=0;i<a.size();i++)	{
		for(int j=i;j<a.size();j++){
			long long max2=(j-i)*a[i]+(n-j)*a[j];
			if(max2>max) max=max2;
		}
	}	
	printf("%lld",max);
		
	return 0;
}