// You are using GCC
#include<bits/stdc++.h>
using namespace std;
void heapify(int heap[],int i,int n){
    int root = i;
    int left = 2*i+1;
    int right = 2*i+2;
    if(left<n && heap[root]<heap[left] ){
        root = left;
    }
     if(right<n && heap[root]<heap[right] ){
        root = right;
    }
    if(root != i){
        swap(heap[i],heap[root]);
        heapify(heap,root,n);
    }
}
void sorting(int heap[],n){
    for(int i=(n-1)/2;i>0;i--){
        heapify(heap,i,n);
    }
    for(int i=n-1;i>0;i--){
        swap[heap[0],heap[i]];
        heapify(heap,i,0);
    }
}
void insert(int heap[],int &size,int val){
    heap[size]=val;
    int n= size;
    size++;
    while(n>0 && heap[(n-1)/2]<heap[n]){
        swap(heap[(n-1)/2],heap[n]);
        n =(n-1)/2;
    }
}
int main(){
   int n;
   cin>>n;
   int size=0;
   int heap[n];
   for (int i=0;i<n;i++){
       int val;
       cin>>val;
       insert(heap,size,val);
   }
   sorting(heap,n);
   
   for (int i=0;i<size;i++){
      cout<<heap[i]<<" ";
   }
   
 }