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

using namespace std;

ifstream in("algsort.in");
ofstream out("algsort.out");
priority_queue<int, vector<int>, greater<int>> s;

int main() {
    int n,a;
    in >> n;
    for(int i = 0; i < n; i++) {
        in >> a;
        s.push(a);
    }
    for(int i = 0; i < n; i++) {
        out << s.top() << " ";
        s.pop();
    }
}