#include<cstdio>
#include<algorithm>
int a[500005],i,n;
using namespace std;/*
int plasare(int st,int dr)
{
    int aux,k;
    int t=1;
    k=st;
    while(st<dr)
    {
        if (t==1)
        if(a[k]>a[dr])
        {
            aux=a[k];
            a[k]=a[dr];
            a[dr]=aux;
            k=dr;
            dr++;
            t=0;
        }
        else dr--;
        else
        if(a[k]<a[st])
        {
            aux=a[k];
            a[k]=a[st];
            a[st]=aux;
            k=st;
            st--;
            t=1;
        }
        else st++;
    }
    return k;
}

void quick(int p,int u)
{
    if (p<u)
    {
        int k=plasare(p,u);
        quick(p,k-1);
        quick(k+1,u);
    }
}
*/
int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    //quick(1,n);
    sort(a+1,a+n+1);
    for(i=1;i<=n;i++)
    {
        printf("%d ",a[i]);
    }
    return 0;
}