#include<iostream>
#include<fstream>
using namespace std;
int v[50200],n;
void qsort(int left, int right){
	int i,j,middle;
	j=right;
	i=left;
	middle=v[(left+right)/2];
	int aux; 
	do{
		while((v[i]<middle) && (i<n)) 
			i++;
		while((v[j]>middle) && (j>1)) 
			j--; 
		if (i<=j){ 
			aux=v[i];
			v[i]=v[j];
			v[j]=aux;
			i++;
			j--;
		}
	}
	while(i<=j);
		if (left<j)
	qsort(left,j);
	if (i<right)
	qsort(i,right);
}
int main(){
	ifstream f("algsort.in");
	ofstream g("algsort.out");
	f>>n;
	for(int i=0;i<n;i++)
		f>>v[i];
	qsort(0,n-1);
	for(int i=0;i<n;i++)
		g<<v[i]<<" ";
	
}