#include <stdio.h>
#include <stdlib.h>
int v[ 500000 ];

void qsort( int v[], int begin, int end ){
    int pivot = v[ begin + rand() % ( end - begin + 1 ) ];
    int b = begin, e = end;
    while( v[ b ] < pivot )
        ++b;
    while( v[ e ] > pivot )
        --e;
    while( b < e ){
        int cop = v[ b ];
        v[ b ] = v[ e ];
        v[ e ] = cop;
        while( v[ ++b ] < pivot );
        while( v[ --e ] > pivot );
    }
    if( begin < e )
        qsort( v, begin, e );
    if( e + 1 < end )
        qsort( v, e + 1, end );
}

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