#include <iostream>
#include <fstream>

using namespace std;

void quickSort(int x[], int n, int left, int right)
{
    int l = left, r = right;
    int pivot = x[(l + r) / 2];
    while (l <= r)
    {
        while (x[l] < pivot)
            ++l;
        while (x[r] > pivot)
            --r;
        if (l <= r)
        {
            int tmp = x[l];
            x[l] = x[r];
            x[r] = tmp;
            ++l;
            --r;
        }
    }
    if (l < right)
        quickSort(x, n, l, right);
    if (r > left)
        quickSort(x, n, left, r);
}

int x[500000];
int n;
ifstream fcin("algsort.in");
ofstream fcout("algsort.out");

int main()
{
    fcin >> n;
    for (int i = 0; i < n; ++i)
        fcin >> x[i];
    quickSort(x, n, 0, n - 1);
    for (int i = 0; i < n; ++i)
        fcout << x[i] << ' ';
}