//归并排序 时间复杂度为O(nlogn)
#include<iostream>
using namespace std;

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

void mergesort(int* q, int l, int r) {
    if (l >= r) return;
    int mid = l + r >> 1;

    mergesort(q, l, mid);
    mergesort(q, mid + 1, r);

    int k = 0, i = l, j = mid + 1;
    while (i <= mid && j <= r) {
        if (q[i] <= q[j]) temp[k ++ ] = q[i ++ ];
        else temp[k ++ ] = q[j ++ ];
    }
    while(i <= mid) temp[k ++ ] = q[i ++ ];
    while(j <= r) temp[k ++ ] = q[j ++ ];
    for (i = l, j = 0; i <= r; i ++ , j ++ ) q[i] = temp[j];
}

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

    mergesort(q, 0, n - 1);
    for (int i = 0; i < n; i ++ ) cout << q[i] <<' ';
    return 0;
}