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