#include <fstream>

using namespace std;

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

int a[500005], N;

int Lomuto_Part(int L, int R)
{
    int st = L, dr = R, x = a[st];
    while(st < dr)
    {
        while(st < dr && a[dr] >= x) dr--;
        a[st] = a[dr];
        while(st < dr && a[st] <= x) st++;
        a[dr] = a[st];
    }
    a[st] = x;
    return st;
}

void QuickSort(int L, int R)
{
    int M = Lomuto_Part(L, R);
    if(M - L > 1) QuickSort(L, M - 1);
    if(R - M > 1) QuickSort(M + 1, R);
}

int main()
{
    cin >> N;
    for(int i = 1; i <= N; i++)
        cin >> a[i];
    QuickSort(1, N);
    for(int i = 1; i <= N; i++)
        cout << a[i] << " ";
    return 0;
}