#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <map>
#include <algorithm>
using namespace std;
void heapadjust(int H[], int s, int m)
{
int rc = H[s];
for (int j = s * 2; j <= m; j*=2)
{
if (j < m&&H[j] > H[j + 1]) j++;
if (rc < H[j]) break;
H[s] = H[j];
s = j;
}
H[s] = rc;
}
void heapsort(int H[], int len)//对顺序表H 进行堆排序
{
for (int i = len / 2; i >= 1; i--)
heapadjust(H, i, len);
for (int i = len; i >= 1; i--)
{
swap(H[i], H[1]);
heapadjust(H, 1, i - 1);
}
}
int main()
{
int a[100];
int n, m;
int x;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
}
heapsort(a, n);
for (int i = n; i >= 1; i--)
{
printf("%d%c", a[i], i == 1 ? '\n' : ' ');
}
return 0;
}
/*
6
12 6 56 23 188 60
*/