#include <bits/stdc++.h>

using namespace std;

int x[500500];

void solve(int left, int right) {
    if (left >= right)
        return ;
    if (right - left <= 2) {
        sort(x + left, x + right + 1);
        return ;
    }
    int pos1 = (2 * left + right) / 3;
    int pos2 = (left + 2 * right) / 3;
    solve(left, pos2);
    solve(pos1, right);
    solve(left, pos2);
}

int main() {
    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);

    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &x[i]);
    solve(1, n);
    for (int i = 1; i <= n; ++i)
        printf("%d ", x[i]);
    return 0;
}