#include <bits/stdc++.h>

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

int n;
priority_queue<int, vector<int>, greater<int> > pq;

int main()
{

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

    while(n--){
        fout << pq.top() << " ";
        pq.pop();
    }

    return 0;
}