#include <fstream>
using namespace std;

const int N = 500005;
int v[N], aux[N], n;

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

inline void sch(int& a, int& b)
{
    int c = a;
    a = b;
    b = c;
}

void quick(int st,int dr)
{
    if (st >= dr)
        return;

    int p = v[dr], i, j;

    for (i = st - 1, j = dr ; i < j ; )
    {
        while (i < j && v[++i] < p);

        while (i < j && v[--j] > p);

        sch(v[i], v[j]);
    }

    sch(v[i], v[dr]);

    quick(st, i - 1);
    quick(i + 1, dr);
}

int main()
{
    in >> n;

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

    quick(1, n);

    for (int i = 1 ; i <= n ; i++)
        out << v[i] << " ";
    out << "\n";
    return 0;
}