#include <cstdio>
#include <algorithm>
using namespace std;
int n;
int v[500000];
int main()
{
    FILE *f=fopen("algsort.in","r");

    FILE *g=fopen("algsort.out","w");



    fscanf(f,"%d",&n);

    for(int i=1;i<=n;i++)
    fscanf(f,"%d",&v[i]);

    sort_heap(v+1,v+n+1);

    for(int i=1;i<=n;i++)
    fprintf(g,"%d ",v[i]);

    return 0;

}