/* 
 * File:   main.cpp
 * Author: virtualdemon
 *
 * Created on May 13, 2010, 9:00 PM
 */
#include <vector>
#include <cstdlib>
#include <fstream>
#include <iterator>
#define Nmax 500011

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