#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
vector <int> a;
int n,i,x;
int main()
{
	freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&x);
		a.push_back(x);
	}
	make_heap(a.begin(),a.end());
	sort_heap(a.begin(),a.end());
	for(i=0;i<n;i++)
		printf("%d ",a[i]);
	return 0;
}