#include<fstream>
using namespace std;
int i, n, aux, j, v[500002];
FILE *fin= fopen("algsort.in","r");
ofstream fout  ("algsort.out");
int main(){
	fscanf(fin,"%d", &n);
	for(i=1; i<=n; i++)
		fscanf(fin,"%d", &v[i]);
	for(i=2; i<=n; i++){
		//consider v[]sortat dde la 1 i-1 si tb inserat acolo v[i]
		aux=v[i];
		j=i-1;
		while(aux<v[j] && j!=0){
			v[j+1]=v[j];
			j--;
		}
		v[j+1]=aux;
	}
	for(i=1; i<=n; i++)
		fout<<v[i]<<" ";
	fout<<"\n";
return 0;
}