#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

int n;
struct cmp{
    bool operator()(int x, int y){return x>y;}};
priority_queue<int, vector<int>, cmp > q;

int main()
{
    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);

    int t;
    scanf("%d\n", &n);
    for(int i=0; i<n; i++){
        scanf("%d ", &t);
        q.push(t);
    }
    while(!q.empty()){
        printf("%d ", q.top());
        q.pop();
    }

    return 0;
}