#include <algorithm>
using namespace std;

#define DIM 500005

int v[DIM];
int n;

void read ()
{
    int i;

    scanf ("%d",&n);
    for (i=1; i<=n; ++i)
        scanf ("%d",&v[i]);
}

void print ()
{
    int i;

    for (i=1; i<=n; ++i)
        printf ("%d ",v[i]);
}

int main ()
{
    freopen ("algsort.in","r",stdin);
    freopen ("algsort.out","w",stdout);

    read ();
    sort (v+1,v+n+1);
    print ();

    return 0;
}