#include <bits/stdc++.h>

using namespace std;

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

int N, a[500005];

void quickSort(int left, int right) {
    int i = left, j = right;
    int pivot = a[(right + left) >> 1];

    while (i <= j) {
        while (a[i] < pivot) {
            ++i;
        }

        while (a[j] > pivot) {
            --j;
        }

        if (i <= j) {
            swap(a[i], a[j]);
            ++i;
            --j;
        }
    }

    if (left < j) {
        quickSort(left, j);
    }

    if (i < right) {
        quickSort(i, right);
    }
}

int main() {
    f >> N;
    for (int i = 1; i <= N; ++i) {
        f >> a[i];
    }

    quickSort(1, N);
    for (int i = 1; i <= N; ++i) {
        g << a[i] << ' ';
    }
    return 0;
}