#include <algorithm>
#include <cstdio>
#include <vector>

using namespace std;

vector<int> read() {
  int n;
  scanf("%d", &n);
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  return a;
}


vector<int> solve(vector<int> a) {
	int n = (int) a.size(), mx = 1;
	while (mx * 2 <= n) {
    mx *= 2;
	}
	bool changes = true;
	while (changes) {
		changes = false;
		for (int x = mx; x > 0; x /= 2) {
			for (int i = 0; i + x < n; i++) {
				if (a[i + x] < a[i]) {
					swap(a[i], a[i + x]);
					changes = true;
				}
			}
		}
	}
	return a;
}

void print(vector<int> a) {
  for (auto &x : a) {
    printf("%d ", x);
  }
  printf("\n");
}

int main() {
  freopen ("algsort.in", "r", stdin);
  freopen ("algsort.out", "w", stdout);
  print(solve(read()));
}