#include <iostream>
#include <vector>
#include <fstream>
using namespace std;

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

const int INSERTION_SORT_THRESHOLD = 16;

void insertionSort(vector<int>& arr, int low, int high) {
    for (int i = low + 1; i <= high; i++) {
        int key = arr[i];
        int j = i - 1;
        while (j >= low && arr[j] > key) {
            arr[j + 1] = arr[j];
            j--;
        }
        arr[j + 1] = key;
    }
}

int partition(vector<int>& arr, int low, int high) {
    int pivot = arr[high];
    int i = low - 1;

    for (int j = low; j < high; j++) {
        if (arr[j] <= pivot) {
            i++;
            swap(arr[i], arr[j]);
        }
    }

    swap(arr[i + 1], arr[high]);
    return i + 1;
}

void quickSort(vector<int>& arr, int low, int high) {
    if (high - low + 1 <= INSERTION_SORT_THRESHOLD) {
        insertionSort(arr, low, high);
        return;
    }

    while (low < high) {
        int pi = partition(arr, low, high);

        if (pi - low < high - pi) {
            quickSort(arr, low, pi - 1);
            low = pi + 1;
        }
        else {
            quickSort(arr, pi + 1, high);
            high = pi - 1;
        }
    }
}

int main() {
    int N;
    f >> N;

    vector<int> arr(N);
    for (int i = 0; i < N; i++) {
        f >> arr[i];
    }

    quickSort(arr, 0, N - 1);

    for (int i = 0; i < N; i++) {
        g << arr[i] << " ";
    }

    return 0;
}