#include <fstream>
#include <queue>
#include <vector>

using namespace std;

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

priority_queue < int, vector<int>, greater<int> > v;
int n, i, x;

int main () {
    fin>>n;
    for (i=1;i<=n;i++) {
        fin>>x;
        v.push(x);
    }

    for (i=1;i<=n;i++) {
        fout<<v.top()<<" ";
        v.pop();
    }

    return 0;
}