#include<stdio.h>

int n,a[1000001];

void qsort(int st,int dr)
{
    int i=st,j=dr,mid=a[(st+dr)/2];
    do{
        while(a[i]<mid)
            i++;
        while(a[j]>mid)
            j--;
        if(i<j)
            {
                int tmp=a[i];
                a[i]=a[j];
                a[j]=tmp;
            }
     }while(i<=j);
    if(st<j)
        qsort(st,j);
    if(i<dr)
        qsort(i,dr);
}

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