//快排，时间复杂度也是O(nlogn)
#include<iostream>
using namespace std;

const int N = 100010;
int n;
int q[N];

void quicksort(int* q, int l, int r) {
    if (l >= r) return;
    int x = q[(l + r) / 2];
    int i = l - 1, j = r + 1;
    while (i < j) {
        do i ++ ; while (q[i] < x);
        do j -- ; while (q[j] > x);
        if (i < j) swap(q[i], q[j]);
    }

    quicksort(q, l, j);
    quicksort(q, j + 1, r);
}

int main(){
    scanf("%d", &n);
    for (int i = 0; i < n; i ++ ) scanf("%d", &q[i]);
    quicksort(q, 0, n - 1);
    for (int i = 0; i < n; i ++ ) cout << q[i] << ' ';
}