#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

vector< int > V;

int main() {
    int N, x, i;
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
    scanf("%d",&N);
	for( i = 0; i < N; i++ ) {
		scanf("%d",&x);
		V.push_back( x );
	}

	make_heap( V.begin(), V.end() );
	sort_heap( V.begin(), V.end() );

	for( i = 0; i < N; i++ )
		printf("%d ",V[i]);


	return 0;
}