#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;

FILE *in; FILE *out;
priority_queue <long> mypq;
long i,k,n,b[500010];

int main () {
    in=fopen ("algsort.in","r"); out=fopen ("algsort.out","w");
    fscanf (in,"%ld",&n);
    for (i=0; i<n; i++) {
        fscanf (in,"%ld",&k);
        mypq.push (k);
    }
    for (i=n-1; i>-1; i--) {
        b[i]=mypq.top ();
        mypq.pop ();
    }
    for (i=0; i<n; i++) fprintf (out,"%ld ",b[i]);
    fprintf (out,"\n");
    fclose (in); fclose (out);
    return 0;
}