#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");

  void heapify(int arr[], int n, int i) {
    // Find largest among root, left child and right child
    int largest = i;
    int left = 2 * i + 1;
    int right = 2 * i + 2;

    if (left < n && arr[left] > arr[largest])
      largest = left;

    if (right < n && arr[right] > arr[largest])
      largest = right;

    // Swap and continue heapifying if root is not largest
    if (largest != i) {
      swap(arr[i], arr[largest]);
      heapify(arr, n, largest);
    }
}

  // main function to do heap sort
void heapSort(int arr[], int n)
{
    // Build max heap
    for (int i = n / 2 - 1; i >= 0; i--)
      heapify(arr, n, i);

    // Heap sort
    for (int i = n - 1; i >= 0; i--) {
      swap(arr[0], arr[i]);

      // Heapify root element to get highest element at root again
      heapify(arr, i, 0);
    }
}

void printArray(int arr[], int n)
{
    for (int i = 0; i < n; ++i)
      fout << arr[i] << " ";
}

int main()
{
    int n; fin>>n; int v[n];

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

    heapSort(v, n);

    printArray(v, n);
    return 0;
  }








/*
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");

int merging (int a[], int low, int mid, int high)
{
   int i, j, k, b[high+1];

   for(i = low, j = mid + 1, k = low; i <= mid && j <= high; k++) {
      if(a[i] <= a[j])      /// lucrez doar pe vectorul a cu 2 jumatati: de la low la mid si de la mid la high si pun in b elementele in ordine cresc.
         b[k] = a[i++];     // b merge de la low la high
      else
         b[k] = a[j++];
   }

   while(i <= mid)
      b[k++] = a[i++];

   while(j <= high)
      b[k++] = a[j++];

   for(int i = low; i <= high; i++)
      a[i] = b[i];          /// pun b-ul inapoi in a
    return *b;
}

int sorting (int v[], int low, int high)
{
    if(low < high)
    {
        int mid = (low + high) / 2;
        sorting (v, low, mid);
        sorting (v, mid+1, high);
        return merging(v, low, mid, high);
    }
    else return *v;
}

int main()
{
    int n;  fin>>n;
    int v[n];

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

    sorting(v, 0, n);

    for (int i=1; i<=n; i++)
        fout << v[i] << " ";

    return 0;
}
*/