#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,i,j,a[500005],schi,maxim,aux,x;
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
    {
        fin>>a[i];
    }
    // bubble sort
    do {
        schi  = 0;
        for (i=1;i<n;i++)
            if (a[i] > a[i+1]) {
                aux = a[i];
                a[i] = a[i+1];
                a[i+1] = aux;
                schi = 1;
            }
    } while (schi == 1);
    for(i=1;i<=n;i++)
    {
        fout<<a[i]<<" ";
    }
    return 0;
}