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

ifstream f ("algsort.in");
ofstream g ("algsort.out");

long long a[500001], n, i, ok;

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

    do
    {
        ok = 1;
        for (i=1; i<n; i++)
            if (a[i] > a[i+1])
                {
                    swap(a[i], a[i+1]);
                    ok = 0;
                }
    }
    while (ok == 0);

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

    return 0;
}