#include <stdio.h>

int v[500000];

void sort( int begin, int end ) {
    int aux, b = begin, e = end, pivot = v[(begin + end) / 2];
    while ( v[b] < pivot )
        b++;
    while ( v[e] > pivot )
        e--;
    while ( b < e ) {
        aux = v[b];
        v[b] = v[e];
        v[e] = aux;
        do
            b++;
        while ( v[b] < pivot );

        do
            e--;
        while ( v[e] > pivot );
    }
    if ( begin < e )
        sort( begin, e );
    if ( e + 1 < end )
        sort( e + 1, end );
}

int main()
{
    FILE *fin, *fout;
    int n, i;
    fin = fopen( "algsort.in", "r" );
    fout = fopen( "algsort.out", "w" );
    fscanf( fin, "%d", &n );
    for ( i = 0; i < n; i++ ) {
        fscanf( fin, "%d", &v[i] );
    }
    sort( 0, n - 1 );
    for ( i = 0; i < n; i++ ) {
        fprintf( fout, "%d ", v[i] );
    }
    fclose( fin );
    fclose( fout );
    return 0;
}