#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f=fopen("algsort.in","r");
FILE *g=fopen("algsort.out","w");
int n,v[500001];

int main(void){
	register int i;
	
	fscanf(f,"%d",&n);
	for(i=1;i<=n;i++){
		fscanf(f,"%d",&v[i]);
	}
	fclose(f);
	bool ok;
	/*do{
		ok=false;
		for(i=1;i<n;i++){
			if(v[i]>v[i+1]){
				int aux=v[i];
				v[i]=v[i+1];
				v[i+1]=aux;
				ok=true;
			}	
		}
	}while(ok);*/
	sort(v+1,v+n+1);
	for(i=1;i<=n;i++)
		fprintf(g,"%d ",v[i]);
	return 0;
}