#include<cstdio>
#define nx 500007
int n,i,v[nx];
using namespace std;

void quick(int l,int r)
{
    int val=v[(l+r)/2],i=l,j=r;

    while(i<=j)
    {
        while(v[i]<val)i++;
        while(v[j]>val)j--;

        if(i<=j)v[i]=v[i]^v[j]^(v[j]=v[i]),i++,j--;
    }

    if(i<r)quick(i,r);
    if(l<j)quick(l,j);
}

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