#include <bits/stdc++.h>

using namespace std;

void stooge_sort(int A[], int lo, int hi) /// O(n^2.7095...)
{
    if (A[lo] > A[hi])
        swap(A[lo], A[hi]);

    int length = hi - lo + 1;

    if (length >= 3)
    {
        stooge_sort(A, lo, hi - length / 3);
        stooge_sort(A, lo + length / 3, hi);
        stooge_sort(A, lo, hi - length / 3);
    }
}

const int MAX_N = 500000 + 1;

int A[MAX_N];
int N;

int main()
{
    ifstream in("algsort.in");
    ofstream out("algsort.out");

    in >> N;

    for (int i = 0; i < N; ++i)
        in >> A[i];

    stooge_sort(A, 0, N - 1);

    for (int i = 0; i < N; ++i)
        out << A[i] << " ";

    return 0;
}