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

4
const int N = 1000010;
5

6
int n;
7
int q[N];
8

9
void quick_sort(int q[], int l, int r) {
10
    if (l >= r) return;
11

12
    int x = q[(l + r) >> 1];
13
    int i = l - 1;
14
    int j = r + 1;
15

16
    while (i < j) {
17
        do i++; while (q[i] < x);
18
        do j--; while (q[j] > x);
19
        if (i < j) swap(q[i], q[j]);
20
    }
21

22
    quick_sort(q, l, j);
23
    quick_sort(q, j + 1, r);
24
}
25

26
int main() {
27
    scanf("%d", &n);
28
    for (int i = 0; i < n; i++) scanf("%d", &q[i]);
29

30
    quick_sort(q, 0, n - 1);
31

32
    for (int i = 0; i < n; i++) printf("%d ", q[i]);
33
    return 0;
34
}