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

using namespace std;

int v[500007];

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

void quick_sort(int st,int dr)
{
    if(st >= dr)
        return;
    int nr = v[Random(st,dr)], i = st, j = dr;

    while(i <j)
    {
        while(i <= dr && v[i] < nr)
            i++;
        while(j >= st && v[j] > nr)
            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;
}