// Tudor Galatan, Vatra Dornei

#include <fstream>

using namespace std;

ifstream inf ("algsort.in");
ofstream outf ("algsort.out");

unsigned long int v[500001];
unsigned int n;
unsigned int i, aux, k;

void read ();
void solve ();
void display ();

int main ()
{
    read ();
    solve ();
    display ();
    return 0;
}

void read ()
{
    inf >> n;
    for (i=0; i<n; i++)
        inf >> v[i];
}

void solve ()
{
    for (k=0; k<n; k++)
    {
        for (i=0; i<n; i++)
            if (v[i] > v[i+1])
            {
                aux = v[i];
                v[i] = v[i+1];
                v[i+1] = aux;
            }
    }
}

void display ()
{
    for (i=1; i<n;)
        outf << v[i++] << " ";
    outf << v[n];
}