#include <bits/stdc++.h>

using namespace std;


priority_queue < int, vector<int>, greater<int> > m;
            /// cu ce,  unde ,   cu ce comparator -> lucreaza
/// greater si less sunt doi operatori de comparare pe care ii foloseste STL. Practic ei stiu sa compare orice tip de data existent deja
int main()
{
    int n,x;
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
    for (int i=1; i<=n; ++i)
        {
        scanf("%d",&x);
        m.push(x);
        }
    while (!m.empty())
    {
        cout<<m.top()<<" ";
        m.pop();
    }
    return 0;
}