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

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

const int maxn = 5e5 + 5;

void QuickSort (int V[], int left, int right) {
    int i = left;
    int j = right;
    int mid = (left + right) >> 1;
    while (i <= j) {
        while (V[i] < V[mid]) i++;
        while (V[j] > V[mid]) j--;
        if (i <= j) {
            swap(V[i], V[j]);
            i++;
            j--;
        }
    }
    if (left < j) QuickSort(V, left, j);
    if (i < right) QuickSort(V, i, right);
}


int main () {
    ios_base :: sync_with_stdio (false);
    int V[maxn], n, i;
    fin >> n;
    for (i = 1; i <= n; i++) {
        fin >> V[i];
    }
    QuickSort(V, 1, n);
    for (i = 1; i <= n; i++) {
        fout << V[i] << " ";
    }
    fout << "\n";
    fin.close();
    fout.close();
    return 0;
}