#include <algorithm>
#include <iterator>
#include <fstream>
template<typename RandomAccessIterator>
void heap_sort(RandomAccessIterator begin, RandomAccessIterator end) {
  std::make_heap(begin, end);
  std::sort_heap(begin, end);
}


int main(){
int a[500000],n,i;
std::ifstream fin("algsort.in");
std::ofstream fout("algsort.out");
fin>>n;for(i=0;i<n;i++)fin>>a[i];
heap_sort(a,a+n);
for(i=0;i<n;i++)
    fout << a[i]<< " ";
return 0;
}