#include <iostream>
#include <fstream>
#include <set>
#include <queue>

using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
multiset < int > ms;
priority_queue < int > Q;
int N;

int main()
{
    fin >> N;
    for(int i = 1; i <= N; ++ i)
    {
        int X;
        fin >> X;
        Q.push(-X);
    }
    while(!Q.empty())
    {
        fout << -Q.top() << " ";
        Q.pop();
    }
    return 0;
}