# 目次

• 目次
• 解答

# 解答

// C++ 14
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <math.h>

#define ll long long
#define Int int
#define loop(x, start, end) for(Int x = start; x < end; x++)
#define loopdown(x, start, end) for(int x = start; x > end; x--)
#define rep(n) for(int x = 0; x < n; x++)
#define span(a,x,y) a.begin()+x,a.begin()+y
#define span_all(a) a.begin(),a.end()
#define len(x) (x.size())
#define last(x) (*(x.end()-1))

using namespace std;

#define loop(x, start, end) for(int x = start; x < end; x++)
#define loopdown(x, start, end) for(int x = start; x > end; x--)

#define left(x) (x * 2)
#define right(x) (x * 2 + 1)

void heapify(vector<int> &vec, int index) {
    int l = left(index);
    int r = right(index);
    
    int largest;
    if (l < vec.size() && vec[l] > vec[index]) largest = l;
    else largest = index;
    if (r < vec.size() && vec[r] > vec[largest]) largest = r;
    
    bool childLarger = largest != index;
    if (childLarger) {
        swap(vec[largest], vec[index]);
        heapify(vec, largest);
    }
}

int main(void){
    int n, x;
    cin >> n;
    vector<int> vec(n+1);
    
    loop(i, 1, n+1) cin >> vec[i];
    
    loopdown(i, vec.size() / 2, 0) heapify(vec, i);
    
    loop(i, 1, n+1) cout << " " << vec[i];
    cout << endl;
    return 0;
}