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

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