#include <fstream>
using namespace std;
ifstream fin ("algsort.in");
ofstream fout ("algsort.out");
int v[1000],h[1000];
int n,i,k,x;
int main () {
	fin>>n;
	for (i=1;i<=n;i++)
		fin>>v[i];
	h[++k]=v[1];
	for (i=2;i<=n;i++) {
		x=k;
		h[++k]=v[i];
		while (v[i]<h[x]&&x>=1) {
			h[x+1]=h[x];
			h[x]=v[i];
			x--;
		}
	}
	for (i=1;i<=n;i++) 
		fout<<h[i]<<" ";
	return 0;
}