#include <algorithm>
#include <fstream.h>
using namespace std;

int main ()
{
	
	long n,a[500001],i;
	

	ifstream f ("text.in");
	ofstream g ("text.out");
	
	f>>n;
	for (i=1;i<=n;i++) f>>a[i];
	
	make_heap(a+1,a+n+1);
	sort_heap(a+1,a+n+1);
	
	for (i=1;i<=n;i++) g<<a[i]<<" ";
	
	g.close ();
	return 0; 
}