#include <stdio.h>
#include<algorithm>

using namespace std;

bool cmp (int a, int b) {
    return (a <= b);
}

int N, v[500001];

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, cmp);
    for (int i = 1; i <= N; ++i)
        printf ("%d ", v[i]);
    return 0;
}