#include <cstdio>
#include <queue>
using namespace std;

FILE* in = freopen("algsort.in", "r", stdin);
FILE* out = freopen("algsort.out", "w", stdout);
priority_queue<long long int> myHeap;

int main()
{
    long long int N;
    long long int x;

    scanf("%lld", &N);
    for (long long int i = 0; i != N; ++i)
    {
        scanf("%lld", &x);
        myHeap.push(x);
    }

    while (!myHeap.empty())
    {
        printf("%lld ", myHeap.top());
        myHeap.pop();
    }

    printf("\n");

    return 0;
}