#include <iostream>
#include <fstream>
#include <cstdlib>

using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");

const int N = 5e5 + 10;

int x[N];
int n;

int compar(const void* a, const void* b)
{
    int x1 = *(int*) a;
    int x2 = *(int*) b;

    return x1 - x2;
}

int main()
{
    fin >> n;

    for(int i = 0; i < n; ++i)
        fin >> x[i];

    qsort(x, n, sizeof(int), compar);

    for(int i = 0; i < n; ++i)
        fout << x[i] << " ";

    return 0;
}