#include <stdio.h>
#include <stdlib.h>
#define N 500000

int v[N];

void swap(int *p1, int *p2)
{
    int aux = *p1;
    *p1 = *p2;
    *p2 = aux;
}
/*
int part_2(int v[], int st, int dr)
{
    int p = st;
    for (int i = st; i < dr; i++)
    {
        if (v[i] <= v[dr])
        {
            swap(&v[p++], &v[i]);
        }
    }
    swap(&v[p], &v[dr]);
    return p;
}
*/

void part_3(int v[], int st, int dr, int *pp1, int *pp2)
{
    int i = st, p1 = st, p2 = dr - 1;
    while (i <= p2)
    {
        if (v[i] < v[dr])
        {
            swap(&v[i++], &v[p1++]);
        }
        else if (v[i] > v[dr])
        {
            swap(&v[i], &v[p2--]);
        }
        else
        {
            i++;
        }
    }
    swap(&v[++p2], &v[dr]);
    *pp1 = p1;
    *pp2 = p2;
}

void quick_sort(int v[], int st, int dr)
{
    if (st >= dr)
    {
        return;
    }
    //int p = part_2(v, st, dr);
    int p1, p2;
    part_3(v, st, dr, &p1, &p2);
    quick_sort(v, st, p1 - 1);
    quick_sort(v, p2 + 1, dr);
}

void shuffle(int v[], int n)
{
    for (int i = n - 1; i > 0; i--)
    {
        long long r = (long long)rand() * rand();
        int p = r % (i + 1);
        swap(&v[i], &v[p]);
    }
}

int main()
{
    FILE *in, *out;
    in = fopen("algsort.in", "r");
    out = fopen("algsort.out", "w");
    int n;
    fscanf(in, "%d", &n);
    for (int i = 0; i < n; i++)
    {
        fscanf(in, "%d", &v[i]);
    }
    shuffle(v, n);
    quick_sort(v, 0, n - 1);
    for (int i = 0; i < n; i++)
    {
        fprintf(out, "%d ", v[i]);
    }
    fprintf(out, "\n");

    fclose(in);
    fclose(out);
    return 0;
}