#include <stdio.h>
#include <algorithm>
#include <fstream.h>
using namespace std;
#define LIM 500005
//FILE *f=fopen("algsort.in", "r"), *g=fopen("algsort.out", "w");
ifstream f("algsorn.in");
ofstream g("algsort.out");
long v[LIM], sw, n, i, aux;

void tipareste()
{
	for (i=1;i<=n;i++)
		g<<v[i]<<" ";
}

int main()
{
	f>>n;
	for (i=1;i<=n;i++)
		f>>v[i];
	//shell();
	sort(v+1, v+n+1);
	tipareste();
	f.close();
	g.close();
	return 0;
}