#include <fstream>

using namespace std;

const int NMAX = 5e5;

int v[1 + NMAX];

void quickSort(int left, int right)
{
    if (left >= right) // == does not work because of the recursive calls with degenerated intervals
        return;

    // pivot
    swap(v[left], v[right]); // v[right] is now pivot
    int idxMove = left;

    for (int i = left; i <= right - 1; ++i)
    {
        if (v[i] < v[right])
        {
            swap(v[i], v[idxMove]);
            ++idxMove;
        }
    }

    swap(v[right], v[idxMove]);

    quickSort(left, idxMove - 1);
    quickSort(idxMove + 1, right);
}

int main()
{
    ifstream in("algsort.in");
    ofstream out("algsort.out");
    ios_base::sync_with_stdio(false);
    in.tie(nullptr);
    out.tie(nullptr);

    int n;
    in >> n;

    for (int i = 1; i <= n; ++i)
        in >> v[i];

    quickSort(1, n);

    for (int i = 1; i <= n; ++i)
        out << v[i] << ' ';
    out << '\n';

    in.close();
    out.close();

    return 0;
}