#include<fstream>
#include<vector>
#include<algorithm>

using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int i,n,x;
vector<int> v;
int main()
{
    fin>>n;
    for(i=0;i<n;++i)
    {
        fin>>x;
        v.push_back(x);
    }
    make_heap(v.begin(),v.end());
    sort_heap(v.begin(),v.end());
    for(vector<int>::iterator it=v.begin();it!=v.end();++it)
        fout<<*it<<' ';
    fout<<'\n';
    return 0;
}