#include <bits/stdc++.h>

using namespace std;

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

int a[500005];

void shellSort(int a[], int n){
    for(int interval = n / 2; interval > 0; interval /= 2){
        for(int i = interval; i <= n; ++i){
            int temp = a[i];
            int j = i;
            while(j >= interval && a[j - interval] > temp){
                a[j] = a[j - interval];
                j = j - interval;
            }
            a[j] = temp;
        }
    }
}

int main(){
    int n;
    f >> n;
    for(int i = 1; i <= n; ++i){
        f >> a[i];
    }
    shellSort(a, n);
    for(int i = 1; i <= n; ++i){
        g << a[i] << " ";
    }
    return 0;
}