#include <cstdio>
#include <algorithm>

#define MAX 500005

using namespace std;

typedef int vector[MAX];

FILE *f, *g;

vector v;
int n;

int citire () {
    int i;
    f = freopen ("algsort.in", "r", stdin);
    if (!f) {
        printf ("Nu se poate deschide fisierul.");
        return 0;
    }
    g = freopen ("algsort.out", "w", stdout);
    if (!g) {
        printf ("Nu se poate deschide fisierul.");
        return 0;
    }

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

    return 1;
}

/* int bubbleSort (vector a) {
    int
        i,
        j,
        aux;

    for (i=1; i<n; ++i) for (j=i+1; j<=n; ++j) if (a[i] > a[j]) {
        aux = a[i];
        a[i] = a[j];
        a[j] = aux;
    }

    return 1;
} */

int afisare () {
    int i;
    for (i=1; i<=n; ++i)
        printf ("%d ", v[i]);
    return 1;
}

int main()
{
    citire ();
    sort (v+1, v+n+1);
    afisare ();
    return 0;
}