#include <fstream>
#include <algorithm>
using namespace std;

ifstream in("algsort.in");
ofstream out("algsort.out");

int N;
int* v;

int Partition(int* a, int start, int end)
{
    int pivot = a[end];
    int poz = start;

    for (int j = start; j < end; ++j)
        if (a[j] <= pivot)
        {
            swap(a[j], a[poz]);
            ++poz;
        }

    swap(a[poz], a[end]);
    return poz;
}

void QuickSort(int* a, int start, int end)
{
    if (start >= end)
        return;

    int pozPivot = Partition(a, start, end);
    QuickSort(a, start, pozPivot - 1);
    QuickSort(a, pozPivot + 1, end);
}

int main()
{
    in >> N;
    v = new int[N + 1];

    for (int i = 0; i != N; ++i)
        in >> v[i];

    QuickSort(v, 0, N - 1);

    for (int i = 0; i != N; ++i)
        out << v[i] << " ";

    in.close();
    out.close();
    delete[] v;

    return 0;
}