#include<fstream>
using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

long a[10];
int n,i,j,k;

void poz ( int li, int ls, int &k, long a[] )
{
	long x, i1=0, j1=-1;
	i=li;
	j=ls;
	while ( i<j )
	{
		if ( a[i]>a[j] )
		{
			x=a[j];
			a[j]=a[i];
			a[i]=x;
			x=i1;
			i1=-j1;
			j1=-x;
		}
		i+=i1;
		j+=j1;
	}
	k=i;
}

void quicksort ( int li, int ls )
{
	if ( li<ls )
	{
		poz (li,ls,k,a);
		quicksort(li,k-1);
		quicksort(k+1,ls);
	}
}

int main()
{
	f>>n;
	for ( i=1; i<=n; i++ )
		f>>a[i];
	quicksort(1,n);
	for ( i=1; i<=n; i++ )
		g<<a[i]<<' ';
	return 0;
}