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

using namespace std;

vector< int > V;

int main() {
    int N, x, i;

	ifstream fi( "algsort.in" );
	ofstream fo( "algsort.out" );

	fi >> N;
	for( i = 0; i < N; i++ ) {
		fi >> x;
		V.push_back( x );
	}

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

	for( i = 0; i < N; i++ )
		fo << V[i] << ' ';

	fi.close(); fo.close();
	return 0;
}