#include <iostream>
using namespace std;

const int N = 100010;

int n;
int q[N];

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

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

    return 0;
}