/* 
 * File:   main.cpp
 * Author: VirtualDemon
 *
 * Created on April 10, 2010, 5:04 PM
 */
#include <vector>
#include <cstdlib>
#include <fstream>
#include <iterator>

/*
 * 
 */
using namespace std;
vector< int > v;
inline void swap( int x, int y )
{
    int aux=v[x];
    v[x]=v[y];
    v[y]=aux;
}
inline void Qsort( int left, int right )
{
    if( left < right )
    {
        int leftPtr=left, rightPtr=right, pValue=v[ left+(right-left)/2 ];
        for( ; ; )
        {
            for( ;  pValue > v[leftPtr]; ++leftPtr );
            for( ;  pValue < v[rightPtr]; --rightPtr );
            if( leftPtr > rightPtr )
                break;
            swap( leftPtr, rightPtr );
            ++leftPtr, --rightPtr;
        }
        if( left < rightPtr )
            Qsort( left, rightPtr );
        if( leftPtr < right )
            Qsort( leftPtr, right );
    }
}
int main(int argc, char** argv)
{
    int N;
    ifstream in( "algsort.in" );
    in>>N;
    copy( istream_iterator<int>(in), istream_iterator<int>(), back_inserter(v) );
    Qsort( 0, N-1 );
    ofstream out( "algsort.out" );
    copy( v.begin(), v.end(), ostream_iterator<int>( out, " " ) );
    out<<'\n';
    return EXIT_SUCCESS;
}