#include <iostream>
#include <fstream>

using namespace std;

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

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

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;
}