/* 
 * File:   main.cpp
 * Author: VirtualDemon
 *
 * Created on April 11, 2010, 1:22 PM
 */
#include <vector>
#include <cstdlib>
#include <fstream>
#include <iterator>
#define Nmax 500001

/*
 * 
 */
using namespace std;
int v[Nmax], v2[Nmax];
inline void MegaSort( int left, int right )
{
    if( left < right )
    {
        int i, j, k, middle=left+(right-left)/2;
        MegaSort( left, middle );
        MegaSort( middle+1, right );
        for( k=0, i=left, j=middle+1; i <= middle && j <= right; ++k )
        {
            if( v[i] <= v[j] )
                v2[k]=v[i], ++i;
            else v2[k]=v[j], ++j;
        }
        for( ; i <= middle; ++i, ++k )
            v2[k]=v[i];
        for( ; j <= right; ++j, ++k )
            v2[k]=v[j];
        for( i=left, k=0; i <= right; ++i, ++k )
            v[i]=v2[k];
    }
}
int main( void )
{
    int N;
    ifstream in( "algsort.in" );
    in>>N;
    copy( istream_iterator<int>(in), istream_iterator<int>(), v );
    MegaSort( 0, N-1 );
    ofstream out( "algsort.out" );
    copy( v, v+N, ostream_iterator<int>( out, " " ) );
    out<<'\n';
    return EXIT_SUCCESS;
}