#include <iostream>
#include <fstream>
#include <vector>
#define NMAX 500000
using namespace std;

ifstream fin("algosort.in");
ofstream fout("algosort.out");

int a[NMAX];

// Consider ca elementele sunt sortate daca pt i < j, cmp(i, j) = true
bool cmp(int arr[], int a, int b) {
    return arr[a] < arr[b];
}

void heapifyDown(int n, int i){
    int left = 2 * i + 1;
    int right = 2 * i + 2;
    int maxIndex = i;

    if (left < n && a[left] > a[maxIndex]) maxIndex = left;
    if (right < n && a[right] > a[maxIndex]) maxIndex = right;

    if (maxIndex != i){
        int aux;
        aux = a[i], a[i] = a[maxIndex], a[maxIndex] = aux;
        heapifyDown(n, maxIndex);
    }
}

void buildHeap(int n){
    int lastParent = n / 2 - 1;
    for (int i = lastParent; i >= 0; --i)
        heapifyDown(n, i);
}

void heapSort(int n){
    buildHeap(n);
    for (int i = n - 1; i > 0; --i){
        int aux;
        aux = a[0], a[0] = a[i], a[i] = aux;
        heapifyDown(i, 0);
    }
}

int main()
{
    int n;

    fin >> n;
    for (int i = 0; i < n; ++i) fin >> a[i];

    heapSort(n);

    for (int i = 0; i < n; ++i)
        fout << a[i] << '\n';

    fin.close();
    fout.close();
    return 0;
}