#include<bits/stdc++.h>
using namespace std;
int a[100005];
void quick_sort(int l, int r){
    if (l<r){     
        int i=l,j=r,x=a[l];
        while (i<j){
            while(i<j && a[j]>=x) j--; 
            if(i<j) a[i++] =a[j];
            while(i<j && a[i]<x) i++; 
            if(i<j) a[j--]=a[i];
        }
        a[i]=x;
        quick_sort(l,i-1);
        quick_sort(i+1,r);
    }
}
int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;++i)cin>>a[i];
    quick_sort(1,n);
    for(int i=1;i<=n;++i)cout<<a[i]<<" ";
    return 0;
}