#include <fstream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <functional>

using namespace std;

int main()
{
	ifstream cin("algsort.in");
	ofstream cout("algsort.out");
	vector<int> gaps;
	int n;
	cin >> n;

	for (int i = 0; i < 18; i++) {
		for (int j = 0; j < 13; j++) {
			int p2 = pow(2, i);
			int p3 = pow(3, j);
			if (1LL * p2 * p3 <= n) {
				gaps.push_back(p2 * p3);
			}
		}
	}

	sort(gaps.begin(), gaps.end(), greater<int>());

	int *a = new int[n];
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}

	for (const int &gap : gaps) {
		int i, j, temp;
		for (i = gap; i < n; i++) {
			temp = a[i];
			for (j = i; j >= gap && a[j - gap] > temp; j -= gap) {
				a[j] = a[j - gap];
			}
			a[j] = temp;
		}
	}

	for (int i = 0; i < n; i++) {
		cout << a[i] << " ";
	}

	return 0;
}