#include <cstdio>
#include <algorithm>
using namespace std;
int V[500005];

void sort(int l,int r){
    int i=l,j=r,piv=V[(l+r)/2];
    while(i<j){
        while(V[i]<piv)i++;
        while(V[j]>piv)j--;
        if(i<=j){
            swap(V[i],V[j]);
            i++;
            j--;
        }
    }
    if(j>l)sort(l,j);
    if(i<r)sort(i,r);
}

int main(){
    int n;
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
        scanf("%d",&n);
        for(int i=1;i<=n;i++)scanf("%d",&V[i]);
    sort(1,n);
        for(int i=1;i<=n;i++)printf("%d ",V[i]);
}