#include <iostream>
#include <fstream>
#define NMAX 500001
#define BUFF_SIZE 100001

using namespace std;

ifstream in("algsort.in");
ofstream out("algsort.out");

int A[NMAX], n;
char buff[BUFF_SIZE];
int pos = 0;
int incr[20], t;

void Read (int &a)
{
    while (!isdigit(buff[pos]))
        if (++pos == BUFF_SIZE)
            in.read(buff, BUFF_SIZE), pos = 0;
    a = 0;
    while (isdigit(buff[pos]))
    {
        a = a * 10 + (buff[pos] - '0');
        if (++pos == BUFF_SIZE)
            in.read(buff, BUFF_SIZE), pos = 0;
    }
}

void ShellSort (int A[], int n)
{
    int inc = incr[t];
    int k, key;
    while (inc)
    {
        for (int i = 1; i <= inc; i++)
            for (int j = i + inc; j <= n; j += inc)
            {
                k = j;
                key = A[j];
                while (k > i && A[k - inc] > key)
                {
                    A[k] = A[k - inc];
                    k -= inc;
                }
                A[k] = key;
            }
        inc = incr[--t];
    }
}

int main()
{
    Read(n);
    incr[1] = t = 1;
    for (int i = 2; incr[i - 1] < n; i++)
    {
        incr[i] = incr[i - 1] * 3 + 1;
        t++;
    }
    if (incr[t] > n)
        t--;
    for (int i = 1; i <= n; i++)
        Read(A[i]);
    in.close();
    ShellSort(A, n);
    for (int i = 1; i <= n; i++)
        out << A[i] << " ";
    out.close();
    return 0;
}