#include <bits/stdc++.h>
using namespace std;

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

int n, v[100001];

int main()
{
    fin >> n;

    for (int i = 1; i <= n; i++)
        fin >> v[i];

    sort(v + 1, v + n + 1);

    long long maxi = 0;

    for (int i = 1; i < n; i++)
        for (int j = i + 1; j <= n; j++)
            maxi = max(maxi, 1LL * v[i] * (j - i) + 1LL * v[j] * (n - j + 1));

    fout << maxi;

    return 0;
}