#include <stdio.h>
#include <queue>
using namespace std;
#define IN "algsort.in"
#define OUT "algsort.out"

struct compare
{
    bool operator() (const int &a, const int &b)
    {
        return a>b;
    }
};

int n,i,x;
priority_queue <int, vector<int>, compare> coada;
int main()
{
    FILE * fin=fopen(IN,"r");
    FILE * fout=fopen(OUT,"w");

    fscanf(fin,"%d",&n);
    for(i=1;i<=n;i++)
    {
        fscanf(fin,"%d",&x);
        coada.push(x);
    }
    fprintf(fout,"%d",coada.top()); coada.pop();
    while(!coada.empty())
    {
        fprintf(fout," %d",coada.top());
        coada.pop();
    }
    fprintf(fout,"\n");

    fclose(fin);
    fclose(fout);
    return 0;
}