#include <bits/stdc++.h>

using namespace std;

void quickSort(int v[], int left, int right) {

    if (left >= right) {
        return;
    }

    int pivot = v[right];
    int i = left, j = right;

    while (i <= j) {
        while (v[i] < pivot) {
            i++;
        }
        while (v[j] > pivot) {
            j--;
        }
        if (i <= j) {
            swap(v[i], v[j]);
            i++, j--;
        }
    }
    quickSort(v, left, j);
    quickSort(v, i, right);
}

int main() {

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

    int v[500000], n, i;

    in >> n;
    for (i = 0; i < n; i++)
        in >> v[i];

    quickSort(v, 0, n - 1);

    for (i = 0; i < n; i++)
        out << v[i] << " ";

    return 0;
}