#include<bits/stdc++.h>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int a[500005], n;
void heapify(int arr[], int n, int i) {
    int largest = i;
    int l = 2*i + 1;
    int r = 2*i + 2;
    if (l < n && arr[l] > arr[largest]) {
        largest = l;
    }
    if (r < n && arr[r] > arr[largest]) {
        largest = r;
    }
    if (largest != i) {
        swap(arr[largest], arr[i]);
        heapify(arr, n, largest);
    }
}
void heapSort(int arr[], int n) {	
    for (int i = n / 2 - 1; i >= 0; i--) {
        heapify(arr, n, i);
    }
    for (int i = n - 1; i >= 0; i--) {
        swap(arr[0], arr[i]);
        heapify(arr, i, 0);
    }	
}
void printArray(int arr[], int n) {	
    for (int i = 0; i < n - 1; i++) {
        fout << arr[i] << ' ';
    }
    fout << arr[n - 1];
}
int main(){ 	
    fin >> n;
    for (int i = 0; i < n; i++) {
        fin >> a[i];
    }
    heapSort(a, n);
    printArray(a, n);
    return 0;
}