#define MAX_N 100000

#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin("avioane.in");
ofstream fout("avioane.out");

int n, A[MAX_N + 1];

int Profit(int l, int r);

int main()
{
	fin >> n;
	for (int i = 1; i <= n; ++i)
	{
		fin >> A[i];
	}
	
	sort(A + 1, A + 1 + n);
	
	int ma = -1;
	for (int i = 2; i <= n; ++i)
	{
		for (int j = 1; j < i; ++j)
		{
			int newMa = Profit(j, i);
			
			if (ma < newMa)
			{
				ma = newMa;
			}
		}
	}
	
	fout << ma;
	
	fin.close();
	fout.close();
	return 0;
}

int Profit(int l, int r)
{
	return A[l] * (r - l) + A[r] * (n - r + 1);
}