#include <cstdio>
#include <algorithm>
#include <ctime>

using namespace std;

int v[500010];

int random(int x,int y)
{
    return x+(1LL*rand()*rand())%(y-x+1);
}

void quicksort(int st,int dr)
{
    if(st>=dr) return;
    int piv=v[random(st,dr)],x=st,y=dr;
    while(x<=y)
    {
        for(;v[x]<piv && x<=dr;x++);
        for(;v[y]>piv && y>=st;y--);
        if(x<=y)
        {
            swap(v[x],v[y]);
            x++;y--;
        }
    }
    quicksort(st,y);
    quicksort(x,dr);
}

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