#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
long long n,m,s,i,k,j,x,y,ss,maxs,cmax,cmin,ux,plux,plumax,cplus,suma,suc,smax;
int a[100000];
ifstream f("avioane.in");
ofstream g("avioane.out");
int main()
{
   f>>n;
   for (i=1;i<=n;i++)
   {
   f>>a[i];
   s=s+a[i];
   }
   s=s/n;
   sort(a+1,a+n+1);

   x=s-3;
   y=s+3;

   for(i=1;i<=n-1000;i++)
   {
    suc=a[i]*(n-i);
    if (suc>smax) {smax=suc;cmin=a[i];}
   }


i=n;
while (a[i]>cmin)
{
ux=a[i];
cplus=ux*(n-i+1)-cmin*(n-i+1);
if (cplus>plumax) {plumax=cplus;cmax=ux;}
i--;
}

for (i=1;i<=n;i++)
{
 if (a[i]>=cmax) {suma=suma+cmax;a[i]=0;}
}
for (i=1;i<=n;i++)
{
if (a[i]>=cmin) suma=suma+cmin;
}
g<<suma;
    f.close();
    g.close();
    return 0;
}