// C++ code to implement quicksort

#include <bits/stdc++.h>
using namespace std;

ifstream in("algsort.in");
ofstream out("algsort.out");
int partition(int arr[], int low, int high)
{
    int pivot = arr[high];

    int i = (low - 1);

    for (int j = low; j <= high - 1; j++) {
        if (arr[j] < pivot) {
            i++;
            swap(arr[i], arr[j]);
        }
    }
    swap(arr[i + 1], arr[high]);
    return (i + 1);
}
void quickSort(int arr[], int low, int high)
{
    if (low < high) {
        int pi = partition(arr, low, high);
        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
    }
}

int main()
{
    int n;
    in >> n;
    int* arr = new int[n];
    for(int i = 0; i < n; ++i)
        in >> arr[i];
    quickSort(arr, 0, n - 1);
    for (int i = 0; i < n; i++)
        out << arr[i] << " ";
    return 0;
}