#include <cstdio>
#include <vector>
#include <algorithm>
#include <limits.h>
//#include <mem.h>
//#include <value.h>
using namespace std;

int N, Mn, Pz;
int v[1000005];

int cmp(const int &x, const int &y)
{
	return x < y;
}

int main()
{
	freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);
	scanf("%d",&N);
	int i;
	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;
}