#include <fstream>
#include <algorithm>

using namespace std;

int main()
{   ifstream fin ("avioane.in");
    ofstream fout ("avioane.out");
    int N, v[100119],i,j,s,max=0,k,max1=0,cat1;
    fin>>N;
    for (i=1;i<=N;i++)
    fin>>v[i];
    sort (v+1,v+1+N);
    for (i=N;i>=1;i--)
    {s=0;
    for (j=N;j>=i;j--)
    s+=v[i];
    if (s>max)
    max=s,k=i,cat1=v[i];}
    N=N+1-k;
    for (i=1;i<=N;i++)
    v[i]=v[i+k-1];

    for (i=N;i>=1;i--)
    {s=0;
    for (j=N;j>=i;j--)
    s+=v[i]-cat1;
    if (s>max1)
    max1=s;}
    s=max+max1;
    fout<<s;
    return 0;
}