#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{freopen("avioane.in","r",stdin);
freopen("avioane.out","w",stdout);
long long nr,v[100001],i,n,val;
long long  Scur,Spos,Sadv;
scanf("%lld",&n);
for(i=1;i<=n;i++)
  scanf("%lld",&v[i]);
sort(v+1,v+n+1);
Scur=v[1]*(n-1);
i=1;
v[n+1]=-1;
while(v[i]==v[i+1]&&i+2<=n)
  i++;
i++;
Spos=v[i]*(n-i);
val=v[1];
while(Scur<Spos&&v[i]!=v[n])
   {Scur=Spos;
   while(v[i]==v[i+1])
      i++;
   i++;
   val=v[i-1];
   if(v[i]!=v[n])
   {Spos=v[i]*(n-i);}}
Sadv=Scur+val;
Scur+=val;
i=n;
nr=1;
while(v[i]==v[i-1]&&i-1>=1)
  {i--;
  Scur-=val;}
Scur-=val;
int pos=1;
while(v[i]*(n-i+1)+Scur>Sadv||pos==1)
  {Sadv=v[i]*(n-i+1)+Scur;
  Scur=Scur-val;
  i--;
  pos=0;
  while(v[i]==v[i-1]&&i-1>=1)
  {i--;
  Scur-=val;}}
if(n>1)
printf("%lld",Sadv);
else
printf("%lld",v[1]);
return 0;
}