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

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

int i, n, j, aux;
int a[500001];

int main()
{
    fin >> n;
    for (i = 1; i <= n; i++)
        fin >> a[i];

    for (i = 1; i < n; i++)
        for (j = i+1; j <= n; j++)
            if (a[i] > a[j])
                swap(a[i], a[j]);

    for (i = 1; i <= n; i++)
        fout << a[i] << " ";

    return 0;
}