#include <cstdio>
#include <algorithm>
using namespace std;

FILE *in = fopen("algsort.in", "r");
FILE *out = fopen("algsort.out", "w");

int N;
unsigned int t[500005];

int main()
{
    fscanf(in, "%d", &N);
    for(int i=0; i<N; ++i)
    {
        fscanf(in, "%u", &t[i]);
    }

    sort(t, t+N);

    for(int i=0; i<N; ++i)
    {
        fprintf(out, "%u ", t[i]);
    }
    return 0;
}