#include <bits/stdc++.h>

using namespace std;

void shell_sort(int A[], int n)
{
    const int gaps[] = {701, 301, 132, 57, 23, 10, 4, 1}; ///Marcin Ciura's gap sequence

    for (int p = 0; p < 8; ++p)
    {
        int gap = gaps[p];

        for (int i = gap; i < n; ++i)
        {
            int temp = A[i];
            int j = i;

            while (j >= gap && A[j - gap] > temp)
            {
                A[j] = A[j - gap];
                j -= gap;
            }

            A[j] = temp;
        }
    }
}

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];

    shell_sort(A, N);

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

    return 0;
}