#include<stdio.h>
#include<algorithm>
using namespace std;
int v[500010], n, i;

struct cmp{
	bool operator()(const int &a, const int &b){
		return a<b;
	}
};

int main()
	{
		freopen( "algsort.in", "r", stdin );  
		freopen( "algsort.out", "w", stdout ); 
		scanf("%d", &n);
		for(i=0;i<n;i++)
			scanf("%d",&v[i]);
		sort(v, v+n, cmp());
		for(i=0;i<n;i++)
			printf("%d ", v[i]);
		return 0;
}