#include<iostream> 
using namespace std;
long long a[10001];
void qSort(int left,int right){
	int pivot=(left+right)/2,i=left,j=right;
	do{
		while(a[left]<a[pivot])
			left++;
		while(a[right]>a[pivot])
			right--;
		if(left<=right)
			swap(a[left],a[right]),left++,right--;
	}while(left<=right);
	if(i<right)
		qSort(i,right);
	if(left<j)
		qSort(left,j);
}int main(){
	long long n;cin>>n;
	for(long long i=1;i<=n;i++)
		cin>>a[i];
	qSort(1,n);
	cout<<a[1];
	for(long long i=2;i<=n;i++)
		cout<<' '<<a[i];
	cout<<endl;
	return 0;
}