#include <cstdio>

#include <cstring>

#include <algorithm>

namespace Heap{

  const int N=;

  const int Inf=0x3f3f3f3f;

  int key[N],len;

  inline void Init(){

    key[]=-Inf;

  }

  inline bool empty(){

    return len==;

  }

  inline int top(){

    return key[];

  }

  inline void push(int val){

    key[++len]=val;int now=len;

    while(key[now]<key[now>>])

      std::swap(key[now],key[now>>]),now=now>>;

  }

  inline void pop(){

    key[]=key[len--];int now=;

    while(now<=(len>>)){

      int next=now<<;

      if(next<len&&key[next]>key[next|])++next;

      if(key[next]>=key[now])break;

      std::swap(key[next],key[now]),now=next;

    }

  }

}

int n;

long long ans;

int main(){

  scanf("%d",&n),Heap::Init();

  for(int i=,x;i<=n;++i)

    scanf("%d",&x),Heap::push(x);

  for(int i=,x,y;i<n;++i)

    x=Heap::top(),Heap::pop(),y=Heap::top(),Heap::pop(),ans+=x+y,Heap::push(x+y);

  printf("%lld",ans);

  return ;

}