#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
long i,j,N;
vector <int> V;
int main ()
{
	freopen("algsort.in", "r", stdin);
	freopen("algsort.out", "w", stdout);
	scanf("%d", &N);
	for (i=1; i<=N; i++)
	{
		scanf("%d", &j);
		V.push_back(j);
	}
	sort( V.begin(), V.end());
	
	for (i=0; i<N; i++)
		printf("%d ", V[i]);
	fclose(stdin); fclose(stdout);
	return 0;
}