#include<iostream>
using namespace std;
const int N=1e6+10;
int n;
void quick_spot(int q[],int l,int r){
    if(l>=r)return;
    int i=l-1,j=r+1,x=q[l+r>>1];
    while(i<j){
        do i++;while(q[i]<x);
        do j--;while(q[j]>x);
        if(i<j)swap(q[i],q[j]);
    }
    quick_spot(q,l,j);
   quick_spot(q,j+1,r);
}
int main(){
    scanf("%d",&n);
    int a[N];
    for(int i=0;i<n;i++)scanf("%d",&a[i]);
    quick_spot(a,0,n-1);
    for(int i=0;i<n;i++)printf("%d ",a[i]);
    return 0;
}