#include <fstream>
#include <queue>
using namespace std;
ifstream cin ("algsort.in");
ofstream cout ("algsort.out");
priority_queue <int, vector <int>, greater <int>> pq;
int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        int x;
        cin >> x;
        pq.push(x);
    }
    while (!pq.empty())
    {
        cout << pq.top() << ' ';
        pq.pop();
    }
    return 0;
}