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

4
const int N = 1000010;
5

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

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

12
    int mid = (l + r) >> 1;
13
    merge_sort(q, l, mid);
14
    merge_sort(q, mid + 1, r);
15

16
    int i = l;
17
    int j = mid + 1;
18
    int k = 0;
19

20
    while (i <= mid && j <= r) {
21
        if (q[i] <= q[j]) tmp[k++] = q[i++];
22
        else tmp[k++] = q[j++];
23
    }
24

25
    while (i <= mid) tmp[k++] = q[i++];
26
    while (j <= r) tmp[k++] = q[j++];
27

28
    for (i = l, j = 0; i <= r; i++, j++) {
29
        q[i] = tmp[j];
30
    }
31
}
32

33
int main() {
34
    scanf("%d", &n);
35
    for (int i = 0; i < n; i++) scanf("%d", &q[i]);
36

37
    merge_sort(q, 0, n - 1);
38

39
    for (int i = 0; i < n; i++) printf("%d ", q[i]);
40
    return 0;
41
}