#include<iostream>
#include<fstream>
using namespace std;
int v[500001],n;
ifstream f("algsort.in");
ofstream g("algsort.out");
void quicksort(int v[],int left,int right){
	int i=left,j=right,pivot=v[left+(right-left)/2];
	while(i<=j){
		while(v[i]<pivot)
			i++;
		while(v[j]>pivot)
			j--;
		if(i<=j){
			swap(v[i],v[j]);
			i++;
			j--;
		}
	}
	if(left<j)
		quicksort(v,left,j);
	if(i<right)
		quicksort(v,i,right);
}
int main(){
	f>>n;
	for(int i=1;i<=n;i++)
		f>>v[i];
	quicksort(v,1,n);
	for(int i=1;i<=n;i++)
		cout<<v[i]<<" ";
	cout<<endl;
	return 0;
}