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