#include <fstream>
#include <queue>


using namespace std;

priority_queue<int, vector<int>, greater<int> > h;

int i, n, x, aux;


int main () {
    ifstream fin("algsort.in");
    ofstream fout("algsort.out");
    fin>>n;

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

    while (!h.empty()) {
        fout<<h.top()<<" ";
        h.pop();
    }

    return 0;
}