#include "bits/stdc++.h"
using namespace std;
#define int long long
const int N = 2e5 + 5;
const int L = 20;
const long long INF = 1ll << 60;
unordered_map<int, vector<int>> dp[N];
int n, a[4 * N];
void merge(vector<int> &a, const vector<int> b, const vector<int> c) {
assert(b.size() && c.size());
assert(b.size() == c.size());
int ptr = 0;
for (int i = 0; ptr < b.size(); i++) {
for (int j = 0; j < (1 << i); j++) {
a.push_back(b[j + ptr]);
}
for (int j = 0; j < (1 << i); j++) {
a.push_back(c[j + ptr]);
}
ptr += 1 << i;
}
}
void DP(int i, int j) {
if (i >= n / 2) {
dp[i][j] = {j};
return;
}
int r = a[2 * i + 1];
int l = a[2 * i];
if (j <= l && j <= r) {
DP(i * 2, l);
DP(i * 2 + 1, r);
vector<int> re{j};
merge(re, dp[i << 1][l], dp[i << 1 | 1][r]);
dp[i][j] = re;
return;
}
if (j <= l) {
DP(i * 2, j);
DP(i * 2 + 1, j);
DP(i * 2, l);
DP(i * 2 + 1, l);
vector<int> re{r};
merge(re, dp[i * 2][l], dp[i * 2 + 1][j]);
vector<int> re2{r};
merge(re2, dp[i * 2][j], dp[i * 2 + 1][l]);
dp[i][j] = min(re, re2);
return;
}
if (j <= r) {
DP(i * 2, j);
DP(i * 2 + 1, r);
vector<int> re{l};
merge(re, dp[i << 1][j], dp[i << 1 | 1][r]);
dp[i][j] = re;
return;
}
if (r < l) {
DP(i * 2, l);
DP(i * 2 + 1, j);
DP(i * 2, j);
DP(i * 2 + 1, l);
vector<int> re{r};
merge(re, dp[i * 2][l], dp[i * 2 + 1][j]);
vector<int> re2{r};
merge(re2, dp[i * 2][j], dp[i * 2 + 1][l]);
dp[i][j] = min(re, re2);
}
else {
DP(i * 2 + 1, r);
DP(i * 2, j);
vector<int> re{l};
merge(re, dp[i * 2][j], dp[i * 2 + 1][r]);
dp[i][j] = re;
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
while (n & (n - 1)) {
a[++n] = INF;
}
DP(1, a[1]);
for (auto u: dp[1][a[1]]) if (u != INF)
cout << u << ' ';
cout << '\n';
return 0;
}
