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

using namespace std;

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

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

int n;

int main()
{
    int x;
    fin >> n;
    for(int i =1; i<=n ;++i)
    {
        fin >> x;
        pq.push(x);
    }
    while(!pq.empty())
    {
        fout << pq.top() << " ";
        pq.pop();
    }
    return 0;
}