#include <fstream>
#include <queue>

using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

int n,i,x;
struct comp {
    bool operator()(const int& a,const int& b) const {
        return (a>b);
    }
};
priority_queue<int,vector<int>,comp> q;

int main () {
    f >> n;
    for (i=1;i<=n;i++) {
        f >> x;
        q.push(x);
    }
    for (i=1;i<=n;i++) {
        x=q.top();
        q.pop();
        g << x << ' ';
    }
    f.close();g.close();
    return 0;
}