#include <iostream>
#include <fstream>
#include <cstdlib>
#include <queue>

using namespace std;

struct comparator {
    bool operator()(int i, int j) {
        return i > j;
    }
};

int main() {
    ifstream in("algosort.in");
    ofstream out("algosort.out");

    int n;
    int element;
    priority_queue<int, std::vector<int>, comparator> pr;

    in >> n;

    for(int i = 1; i <= n; i++)
    {
        in >> element;
        pr.push(element);
    }



    for(int i = 1; i <= n; i++ ){
        out << pr.top() << " ";
        pr.pop();
    }

    return 0;
}