//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <unordered_map>
#define ll long long
#define maxn 200005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
int a[maxn], n;
void merge(vector<int> v1, vector<int> v2, vector<int> & ret) {
for (int i = 0;(1<<(i + 1)) - 1 <= v2.size();i++) {
for (int j = (1<<i);j < (1<<(i + 1));j++) ret.push_back(v1[j - 1]);
for (int j = (1<<i);j < (1<<(i + 1));j++) ret.push_back(v2[j - 1]);
if ((1<<(i + 2)) - 1 > v2.size()) {
for (int j = (1<<(i + 1)) - 1;j < v1.size();j++) ret.push_back(v1[j]);
for (int j = (1<<(i + 1)) - 1;j < v2.size();j++) ret.push_back(v2[j]);
return;
}
}
}
vector<int> ind[maxn];
vector< vector<int> > ans[maxn];
vector<int> solve(int v, int x) {
for (int i = 0;i < ind[v].size();i++) {
if (ind[v][i] == x) return ans[v][i];
}
vector<int> ret;
ret.push_back(x);
bool lef = 2 * v <= n, rig = 2 * v + 1 <= n;
if (!lef && !rig) {
return ret;
} else if (!rig) {
ret.push_back(a[2 * v]);
if (a[2 * v] < x) swap(ret[0], ret[1]);
return ret;
} else {
int l = a[2 * v], r = a[2 * v + 1];
if (x < l && x < r) {
merge(solve(v * 2, l), solve(v * 2 + 1, r), ret);
} else if (l < x && l < r) {
ret[0] = l;
merge(solve(v * 2, x), solve(v * 2 + 1, r), ret);
} else {
ret[0] = r;
vector<int> v1, v2;
merge(solve(v * 2, l), solve(v * 2 + 1, x), v1);
merge(solve(v * 2, x), solve(v * 2 + 1, l), v2);
for (int i = 0;i < v1.size();i++) {
if (v1[i] < v2[i]) {
ret.insert(ret.end(), v1.begin(), v1.end());
break;
} else if (v1[i] > v2[i]) {
ret.insert(ret.end(), v2.begin(), v2.end());
break;
}
}
}
ind[v].push_back(x);
ans[v].push_back(ret);
return ret;
}
}
int main() {
io
cin >> n;
for (int i = 1;i <= n;i++) cin >> a[i];
vector<int> out = solve(1, a[1]);
for (int i:out) cout << i << " ";
cout << "\n";
}
/*
5
3 4 2 5 1
*/
