#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
vector <int> v;
int main()
{
    int n,x;
    fin>>n;
    for(int i=0;i<n;i++){
        fin>>x;
        v.push_back(x);}
    make_heap(v.begin(),v.end());
    sort_heap(v.begin(),v.end());
    for(int i=0;i<n;i++)
        fout<<v[i]<<" ";
    return 0;
}