#include <iostream>

using namespace std;
int v[500001];
int n,i;
void QuickSort(int st, int dr)
{
    int aux,mij,minn,maxx;
    mij=v[(st+dr)/2];
    minn=st;
    maxx=dr;
    do
    {
        while(v[minn]<mij)
            minn++;
        while(v[maxx]>mij)
            maxx--;
        if(minn<=maxx)
        {
            aux=v[minn];
            v[minn]=v[maxx];
            v[maxx]=aux;
            minn++;
            maxx--;
        }
    }while(minn<=maxx);
    if(st<maxx)
    QuickSort(st,maxx);
    if(minn<dr)
    QuickSort(minn,dr);
}
int main()
{
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>v[i];
    }
    QuickSort(1,n);
    for(i=1;i<=n;i++)
        cout<<v[i]<<' ';
    return 0;
}