#include <cstdio>
#include <algorithm>
#include <ctime>
#include <cstdlib>
#define Nmax 500005

using namespace std;

int a[Nmax],n;

inline int Pivot(int st, int dr, int piv)
{
    int i=st,j=dr;
    while(i<=j)
    {
        if(a[i]<=a[piv]) ++i;
        else
            if(a[j]>=a[piv]) --j;
            else
            {
                swap(a[i],a[j]);
                ++i; --j;
            }
    }
    swap(a[piv],a[i-1]);
    return i-1;
}

inline void QuickSort(int st, int dr)
{
    if(st>=dr) return;
    srand(time(0));
    int piv=rand()%(dr-st+1)+st,poz;
    poz=Pivot(st,dr,piv);
    QuickSort(st,poz-1); QuickSort(poz+1,dr);
}

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