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