#include <cstdio>
#include <cstdlib>

unsigned int N, v[200010];

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

int main() {
	int i;
	
	freopen( "algsort.in", "r", stdin );
	freopen( "algsort.out", "w", stdout );

	scanf( "%d", &N );

	for( i = 0; i < N; i++ ) {
		scanf( "%u", &v[i] );
	}

	qsort( v, N, sizeof( v[0] ), sortf );

	for( i = 1; i <= N; i++ ) {
		printf( "%u", v[i] );
	}

	return 0;
}