#include <fstream>
#include <queue>

using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");

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

int n;
priority_queue<int,vector<int>,cmp> q;

void rez()
{
    int i,x;
    for(i=1;i<=n;i++)
        {
            fin>>x;
            q.push(x);
        }
    while(!q.empty())
          {
              fout<<q.top()<<" ";
              q.pop();
          }
}

int main()
{
    fin>>n;
    rez();


    return 0;
}