#include<fstream>
#include<queue>

using namespace std;

int main()
{
          ifstream f("algsort.in");
          ofstream g("algsort.out");
          
          int n, i, x;
          
          priority_queue<int> lista;
          vector<int>a;
          vector<int>::iterator it;
          
          f>>n;
          
          for(i = 1; i <= n; i++)
          {
                  f>>x;
                  lista.push(x);
          }
          
          while(!lista.empty())
          {
               x = lista.top();
               a.push_back(x);
               lista.pop();
          }
          reverse(a.begin(), a.end());
          for(it = a.begin(); it != a.end(); it++)
                g<<*it<<" ";
          
          return 0;
}