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

using namespace std;

unsigned int N;//, v[500010];
vector< unsigned int > v;

int sortf( const void *x, const void *y ) {
	return *(unsigned int *)x - *(unsigned int *)y;
}

int main() {
	unsigned int i, x;
/*
	freopen( "algsort.in", "r", stdin );
	freopen( "algsort.out", "w", stdout );
*/
	ifstream fi( "algsort.in" );
//	ofstream fo( "algsort.out" );

/*
	scanf( "%d", &N );

	for( i = 0; i < N; i++ ) {
		scanf( "%u", &v[i] );
	}
*/
	fi >> N;
	for( i = 0; i < N; i++ ) {
		fi >> x;
		v.push_back( x );
	}

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

	//sort( v, v+N );
	//qsort( v, N, sizeof( v[0] ), sortf );
/*
	for( i = 0; i < N; i++ ) {
		printf( "%u", v[i] );
	}
*/

/*
	for( i = 0; i < N; i++ )
		fo << v[i];
*/
	fi.close(); //fo.close();
	
	return 0;
}