#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000;
int n, A[maxn+10];
vector<int> memo[maxn+10][36];
void merge(vector<int> &res, int root, vector<int> &L, vector<int> &R) {
res.push_back(root);
int lidx = 0, ridx = 0;
int cur = 1;
while (lidx < L.size() || ridx < R.size()) {
for (int i = 0; i < cur; i++) {
if (lidx < L.size()) res.push_back(L[lidx++]);
}
for (int i = 0; i < cur; i++) {
if (ridx < R.size()) res.push_back(R[ridx++]);
}
cur *= 2;
}
}
vector<int> &dp(int u, int par) {
if (memo[u][par].size() > 0) return memo[u][par];
int idx = u, p = par;
while (p >= 2) {
p -= 2;
idx /= 2;
}
if (p == 1) idx *= 2;
int cur = A[idx];
int l = u*2, r = u*2+1;
if (l > n && r > n) {
memo[u][par].push_back(cur);
return memo[u][par];
} else if (r > n) {
if (A[l] < cur) {
memo[u][par].push_back(A[l]);
memo[u][par].push_back(cur);
} else {
memo[u][par].push_back(cur);
memo[u][par].push_back(A[l]);
}
return memo[u][par];
}
int L = A[l], R = A[r];
// no swap
if (cur < L && cur < R) {
merge(memo[u][par], cur, dp(l, 0), dp(r, 0));
return memo[u][par];
}
// swap left
if (cur > L && L < R) {
merge(memo[u][par], L, dp(l, par+2), dp(r, 0));
return memo[u][par];
}
if (R < cur && R < L) {
// swap right
merge(memo[u][par], R, dp(l, 0), dp(r, par+2));
vector<int> tmp;
// swap both
merge(tmp, R, dp(l, par+2), dp(r, 3));
if (tmp < memo[u][par]) {
memo[u][par] = tmp;
}
return memo[u][par];
}
assert(false);
}
int main() {
cin.tie(0); ios_base::sync_with_stdio(0);
cin >> n; for (int i = 1; i <= n; i++) cin >> A[i];
vector<int> ans = dp(1, 0);
for (int v : ans) cout << v << " ";
cout << "\n";
return 0;
}
