#include <bits/stdc++.h>

using namespace std;

int a[500005];
int n;

int partitionare(int a[], int st, int dr)
{
    int pivot = a[dr];
    int i = st - 1;
    for(int j = st; j <= dr - 1; ++j) {
        if(a[j] <= pivot) {
            i++;
            swap(a[i], a[j]);
        }
    }
    swap(a[i + 1], a[dr]);
    return i + 1;
}

void Q_Sort(int a[], int st, int dr)
{
    if(st < dr) {
        int q = partitionare(a, st, dr);
        Q_Sort(a, st, q - 1);
        Q_Sort(a, q + 1, dr);
    }
}

int main()
{
    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);

    cin >> n;

    for(int i = 1; i <= n; ++i) cin >> a[i];

    Q_Sort(a, 1, n);

    for(int i = 1; i <= n; ++i) cout << a[i] << " ";

    return 0;
}