/**
* author : pham van sam
* created : 16 June 2023 (Friday)
**/
#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
#define MASK(x) (1LL << (x))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0, _n = n; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define FORE(it, s) for (__typeof(s.begin()) it = (s).begin(); it != (s).end(); ++it)
template <typename U, typename V> bool maximize(U &A, const V &B) { return (A < B) ? (A = B, true) : false; }
template <typename U, typename V> bool minimize(U &A, const V &B) { return (A > B) ? (A = B, true) : false; }
const int MAXN = 2e5 + 5;
int N, a[MAXN];
int dp(int u, int val) {
if(u * 2 > N) return u;
if(val < min(a[u * 2], a[u * 2 + 1])) return u;
if(a[u * 2] < min(val, a[u * 2 + 1])) return dp(u * 2, val);
int Min = min(a[u * 2], val);
if(dp(u * 2, Min) < dp(u * 2 + 1, Min)) return (val == Min ? dp(u * 2, val) : dp(u * 2 + 1, val));
return (val == Min ? dp(u * 2 + 1, val) : dp(u * 2, val));
}
void process(void) {
cin >> N;
memset(a, 0x3f, sizeof a);
FOR(i, 1, N) cin >> a[i];
FOR(u, 1, N) {
if(u * 2 > N) continue;
if(a[u] < min(a[u * 2], a[u * 2 + 1])) continue;
if(a[u * 2] < min(a[u], a[u * 2 + 1])) {
swap(a[u * 2], a[u]);
continue;
}
swap(a[u], a[u * 2 + 1]);
int Min = min(a[u * 2], a[u * 2 + 1]);
if(dp(u * 2, Min) < dp(u * 2 + 1, Min)) {
if(a[u * 2] > a[u * 2 + 1]) swap(a[u * 2], a[u * 2 + 1]);
} else if(a[u * 2] < a[u * 2 + 1]) swap(a[u * 2], a[u * 2 + 1]);
}
FOR(i, 1, N) cout << a[i] << " \n"[i == N];
}
signed main() {
#define TASK "TASK"
if(fopen(TASK".inp", "r")) {
freopen(TASK".inp", "r", stdin);
freopen(TASK".out", "w", stdout);
}
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
auto start_time = steady_clock::now();
int test = 1;
// cin >> test;
for (int i = 1; i <= test; ++i) {
process();
// cout << '\n';
}
auto end_time = steady_clock::now();
cerr << "\nExecution time : " << duration_cast<milliseconds> (end_time - start_time).count() << "[ms]" << endl;
return (0 ^ 0);
}
