#include <cstdio>
#include <algorithm>
using namespace std;

FILE *f = fopen ( "sort.in" , "r" ) , *g = fopen ( "sort.out" , "w" );

const int MAX = 500005;
int Size , myInts [ MAX ] , i;

void read()
{
    fscanf ( f , "%d" , &Size );
    for ( i = 0 ; i < Size ; i ++ )
        fscanf ( f , "%d" , &myInts [ i ] );
}

void print()
{
    for ( i = 0 ; i < Size ; i ++ )
        fprintf ( g , "%d " , myInts [ i ] );
}

int main()
{
    read();
    sort ( myInts , myInts + Size );
    print();
    return 0;
}