#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 200001;
map<pi,int> bes;
int n, p[MX];
int get(int ind, int y) {
if (bes.count({ind,y})) return bes[{ind,y}];
if (2*ind > n) return ind;
if (2*ind+1 > n) {
if (y > p[2*ind]) return 2*ind;
return ind;
}
if (y < min(p[2*ind],p[2*ind+1])) return bes[{ind,y}] = ind;
if (p[2*ind] < min(y,p[2*ind+1])) return bes[{ind,y}] = get(2*ind,y);
int mn = min(y,p[2*ind]);
if (get(2*ind,mn) < get(2*ind+1,mn)) {
if (mn == y) return bes[{ind,y}] = get(2*ind,y);
return bes[{ind,y}] = get(2*ind+1,y);
} else {
if (mn == y) return bes[{ind,y}] = get(2*ind+1,y);
return bes[{ind,y}] = get(2*ind,y);
}
}
void solve(int ind) {
if (2*ind > n) return;
if (2*ind+1 > n) {
if (p[ind] > p[2*ind]) swap(p[ind],p[2*ind]);
return;
}
if (p[ind] < min(p[2*ind],p[2*ind+1])) {
} else if (p[2*ind] < min(p[ind],p[2*ind+1])) {
swap(p[2*ind],p[ind]);
} else {
int mn = min(p[ind],p[2*ind]), mx = max(p[ind],p[2*ind]);
p[ind] = p[2*ind+1];
if (get(2*ind,mn) < get(2*ind+1,mn)) {
p[2*ind] = mn, p[2*ind+1] = mx;
} else {
p[2*ind] = mx, p[2*ind+1] = mn;
}
}
solve(ind+1);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n;
FOR(i,1,n+1) cin >> p[i];
solve(1);
FOR(i,1,n+1) cout << p[i] << " ";
}
/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/
