#include<bits/stdc++.h>
using namespace std;
int a[100007];
void QuickSort(int l,int r){
    
    
	int i = l,j = r;
	int mid = a[(l+r)/2];
	do{
    
    
		while(a[i]<mid)i++;
		while(a[j]>mid)j--;
		if(i<=j){
    
    
			swap(a[i],a[j]);
			i++;
			j--;
		}
	}while(i<=j);		
	if(l<j)QuickSort(l,j);
	if(i<r)QuickSort(i,r);
}

int main(){
    
    
	int i,n;
	cin>>n;
	for(i=0;i<n;i++){
    
    
		cin>>a[i];
	}
	QuickSort(0,n-1);
	for(i=0;i<n;i++){
    
    
		cout<<a[i]<<" ";
	}
	cout<<endl;
	return 0;
}