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

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> make(vector<int> a, int k) {
  int n = (int) a.size();
  for (int i = 0; i + k < n; i++) {
    if (a[i + k] < a[i]) {
      swap(a[i + k], a[i]);
    }
  }
  return a;
}

vector<int> solve(vector<int> a) {
  int n = (int) a.size();
  for (int i = 1; i <= 10; i++) {
    a = make(a, i);
  }
  for (int i = 1; i <= n; i *= 2) {
    a = make(a, i);
  }
  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()));
}