#include <algorithm>
#include <vector>
#include <cstdio>

using namespace std;

vector<int> v;

int main()
{
 int i, x, n;

 freopen("heapsort.in","r",stdin);
 freopen("heapsort.out","w",stdout);

 scanf("%d",&n);

 for(i = 0; i < n; i++ )
 {
 scanf("%d",&x);
 v.push_back(x);
 }
 make_heap(v.begin(),v.end());
 sort_heap(v.begin(),v.end());


 for(i = 0; i < n; i++)
 {
 printf("%d ",v[i]);
 }
 return 0;
}