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