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

using namespace std;

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

int A[NMAX], n;

void ShellSort (int A[], int n)
{
    int inc = n >> 1;
    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 >>= 1;
    }
}

int main()
{
    in >> n;
    for (int i = 1; i <= n; i++)
        in >> A[i];
    in.close();
    ShellSort(A, n);
    for (int i = 1; i <= n; i++)
        out << A[i] << " ";
    out.close();
    return 0;
}