#include <stdio.h>
#include <stdlib.h>

#define N 500000

int v[N];

int part_2(int v[], int st, int dr)
{
    int poz = st;
    for (int i = st; i < dr; i++)
    {
        if (v[i] <= v[dr])
        {
            int aux = v[poz];
            v[poz] = v[i];
            v[i] = aux;
            poz++;
        }
    }
    int aux = v[poz];
    v[poz] = v[dr];
    v[dr] = aux;
    return poz;
}

void quick_sort(int v[], int st, int dr)
{
    if (st >= dr)
    {
        return;
    }
    int poz_p = part_2(v, st, dr);
    quick_sort(v, st, poz_p - 1);
    quick_sort(v, poz_p + 1, dr);
}

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