#include <cstdio>
#include <algorithm>

#define in "algsort.in"
#define out "algsort.out"
#define NMAX (500000 + 7)

using namespace std;
int n, v[NMAX], gap[10] = {30127, 1750, 701, 301, 132, 57, 23, 10, 4, 1};

void shellSort()
{
    for(int t = 0; t< 10; ++t)
    {
        for(int i = 1; i<= n; ++i)
        {
            int p = i;
            while(p-gap[t] >= 1)
            {
                if(v[p-gap[t]] > v[p])
                {
                    swap(v[p-gap[t]], v[p]);
                    p = p-gap[t];
                }
                else break;
            }
        }
    }
}

int main()
{
    freopen(in, "r", stdin);
    freopen(out, "w", stdout);
    scanf("%d", &n);
    for(int i = 1; i<= n; ++i) scanf("%d", &v[i]);
    shellSort();
    for(int i = 1; i<= n; ++i) printf("%d ", v[i]);
    printf("\n");
    return 0;
}