#include <bits/stdc++.h>

using namespace std;

int N, i, X;

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

int main()
{
    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);

    scanf("%d", &N);

    for(i=1; i<=N; i++)
    {
        scanf("%d", &X);

        H.push(X);
    }

    for(i=1; i<=N; i++)
    {
        printf("%d ", H.top());

        H.pop();
    }

    printf("\n");

    return 0;
}