#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    	freopen( "algsort.in", "r", stdin );
    	freopen( "algsort.out", "w", stdout );
    	
    	int i, x, n;
   	scanf( "%d", &n );
   	
   	vector< int > v;
   	
   	v.reserve(n);
	
    	for( i = 1; i <= n; i++ ) {
        	scanf( "%d", &x );
        	v.push_back( x );
    	}

    	sort( v.begin(), v.end() );

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

    	return 0;
}