#include <stdio.h>
#include <algorithm>

using namespace std;

FILE *f,*s;

int v[500005];

int main()
{
	f=fopen("algsort.in","r");
	s=fopen("algsort.out","w");
	
	int i,j,k,l,m,n;
	
	fscanf(f,"%d",&n);
	
	for(i=1;i<=n;i++)
		fscanf(f,"%d",&v[i]);
	
	sort(v+1,v+n+1);
	
	for(i=1;i<=n;i++) fprintf(s,"%d ",v[i]);
	
	fclose(s);
	
	return 0;
}