#include <iostream>
#include<vector>
#include<algorithm>
 void minheap(vector<int> &heap , int k){
     heap.push_back(k);
     int i=heap.size()-1;
     int parent=(i-1)/2;
     while(i>0 && heap[parent]>heap[i]){
         swap(heap[parent],heap[i]);
         i=parent;
         parent=(i-1)/2;
     }
     
     
 } 


int main() {
    int n;
    cin>>n;
    vector<int> heap;
    
    for(int i=0;i<n;i++){
        int k;
        cin>>k;
        minheap(heap,k);
    }
    
    for(int i=0;i<n;i++){
        cout<<heap[i]<<" ";
    }
return 0;
}