#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

int N, i, x;
vector<int> v;
vector<int>:: iterator it;

void readData(void)
{
	freopen("algsort.in", "r", stdin);
	scanf("%d", &N);
	for(i = 1; i <= N; i++)
		scanf("%d", &x), v.push_back(x);
	
	fclose(stdin);
}

void solveProblem(void)
{
	make_heap(v.begin(), v.end());
	sort_heap(v.begin(), v.end());
}

void printData(void)
{
	freopen("algsort.out", "w", stdout);
	for(it = v.begin(); it != v.end(); it++)
		printf("%d ", *it);
	
	fclose(stdout);
}
int main(void)
{
	readData();
	solveProblem();
	printData();
	
	return 0;
}