#include <iostream>
#include <queue>
#include <vector>
//最优二叉树：带权值的二叉树
using namespace std;

priority_queue<int ,vector<int> ,greater<int> >p;

//一组数据
int main()
{
    int n;
    int tmp;
    int x,y;
    cin >> n;
    for(int i = 0 ; i < n ; i++)
    {
        cin >> tmp;
        x = tmp;
        p.push(x);

    }
    int sum = 0;

    cout << p.top() << endl;
    while(!p.empty())
    {
      
        x = p.top(); //取出一个最小值
        p.pop();
        if(n == 1)
            break;
        y = p.top();  //取出一个最小值
        p.pop();
        n--;
        x += y;
        sum += x;
        
        p.push(x);
    }

    cout << sum << endl;
    return 0;
}