#include <fstream>
#include <algorithm>

using namespace std;

const char InFile[]="avioane.in";
const char OutFile[]="avioane.out";
const int MaxN=100111;

ifstream fin(InFile);
ofstream fout(OutFile);

int N,v[MaxN];
long long sol;

inline long long calc(const int &st, const int &dr)
{
	return (long long)(N-dr+1)*(long long)(v[dr])+(long long)(dr-st)*(long long)(v[st]);
}

int main()
{
	fin>>N;
	for(register int i=1;i<=N;++i)
	{	
		fin>>v[i];
	}
	fin.close();

	sort(v+1,v+1+N);
	
	for(register int i=1;i<=N;++i)
	{
		for(register int j=i+1;j<=N;++j)
		{
			long long c=calc(i,j);
			if(c>sol)
			{
				sol=c;
			}
		}
	}

	fout<<sol;
	fout.close();
	return 0;
}