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

using namespace std;

int v[500010];

int Random(int a,int b)
{
    return a+(1LL*rand()*rand())%(b-a+1);
}

void quick_sort(int st,int dr)
{
    if(st>=dr) return;
    int a=v[Random(st,dr)],i=st,j=dr;
    while(i<=j)
    {
        while(i<=dr && v[i]<a) i++;
        while(j>=st && v[j]>a) j--;
        if(i<=j)
        {
            swap(v[i],v[j]);
            i++;j--;
        }
    }
    quick_sort(st,j);
    quick_sort(i,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]);
    quick_sort(1,n);
    for(int i=1;i<=n;i++) printf("%d ",v[i]);
    return 0;
}