#include<cstdio>
using namespace std;
int v[500001];
void quicksort(int lf, int rh){
    int mij=v[(lf+rh)/2];
    int i=lf,j=rh,aux;
    while(i<=j){
        while(v[i]<mij)i++;
        while(v[j]>mij)j--;
        if(i<=j){
            aux=v[i];
            v[i]=v[j];
            v[j]=aux;
            i++;
            j--;
        }
    }
    if(i<rh)quicksort(i,rh);
    if(lf<j)quicksort(lf,j);
}
int main(){
    int i,n;
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d ",&v[i]);

    quicksort(1,n);
    for(i=1;i<=n;i++)
        printf("%d ",v[i]);
    printf("\n");
    return 0;
}