#include<cstdio>
#include<algorithm>
using namespace std;

const char in[]="algsort.in";
const char out[]="algsort.out";

const int N = 500005;

int v[N], n;

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

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