#include<stdio.h>
void quick_sort(int a[],int l,int r)
{
    int x,i,j,t;
    x=a[l];i=l-1;j=r+1;
    if (l>=r)
        return;
    while (i<j)
    {
        do
        {
            i++;
        }while (a[i]<x);
        do
        {   
            j--;
        }while (a[j]>x);
        if (i<j)
        {
            t=a[i];a[i]=a[j];a[j]=t;
        }
    }
    quick_sort(a,l,j);
    quick_sort(a,j+1,r);
}
int main()
{
    int a[100001],i,n;
    scanf("%d",&n);
    for (i=0;i<n;i++)
        scanf("%d",&a[i]);
    quick_sort(a,0,n-1);
    for (i=0;i<n;i++)
        printf("%d ",a[i]);
    return 0;
}