#include <bits/stdc++.h>

using namespace std;

void comb_sort(int A[], int N)
{
    int gap = N;
    float shrink = 1.3;
    bool swapped = true;

    while (gap > 1 || swapped == true)
    {
        gap = int(1.0 * gap / shrink);

        if (gap < 1)
            gap = 1;

        int i = 0;
        swapped = false;

        while (i + gap < N)
        {
            if (A[i] > A[i + gap])
            {
                swap(A[i], A[i + gap]);
                swapped = true;
            }

            i++;
        }
    }
}

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

    comb_sort(A, N);

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

    return 0;
}