#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

int n, a[500005];

int cmpfunc (const void * a, const void * b)
{
   return ( *(int*)a - *(int*)b );
}

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

    scanf("%d", &n);
    for (int i = 0; i < n; i++)
        scanf("%d", &a[i]);
    qsort(a, n, sizeof(int), cmpfunc);
    for (int i = 0; i < n; i++)
        printf("%d ", a[i]);

    return 0;
}