#include <bits/stdc++.h>
#define NMAX (int)(5e5 + 5)

using namespace std;

int n, v[NMAX];

int compare (int a, int b)
{
    if (a < b) return 1;
    return 0;
}

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

    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &v[i]);

    sort (v+1, v+n+1, compare);
    for (int i = 1; i <= n; ++i)
        printf("%d ", v[i]);
    printf("\n");

    return 0;
}