#include <fstream>
#include <algorithm>

using namespace std;

int n, a [ 100009 ];

int main(){
    //suppose there are no negative numbers
    int i, j;
    ifstream f ( "avioane.in" );
    ofstream g ( "avioane.out" );
    f >> n;
    for ( i = 0; i < n; ++ i )
        f >> a [ i ];
    f.close();
    sort ( a, a + n );
    unsigned long long s, maxs = 0;
    for ( i = 0; i < n; ++ i )
        for ( j = i + 1; j < n; ++ j ) {
            s = ( n - j ) * 1ll * a [ j ] + ( j - i ) * 1ll * a [ i ];
            if ( maxs < s )
                maxs = s;
        }
    g << maxs << endl;
    g.close();
    return 0;
}