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

long int v[500010];
long int n,i;

FILE *in, *out;
/*
int compare(const void *a,const void *b)
{
	return *(long int *)a - *(long int *)b;
}
*/
int main()
{
	in=fopen("algsort.in","r");
	fscanf(in,"%ld", &n);
	for (i=0;i<n;++i) fscanf(in,"%ld", &v[i]);
	fclose(in);
	//qsort(v,n,sizeof(int),compare);
	sort(v+1,v+n+1);
	out=fopen("algsort.out","w");
	for (i=0;i<n;++i){
			 fprintf(out,"%ld", v[i]);
			 fprintf(out,"%c" ,' ');
			 }
	fclose(out);
return 0;
}