/* 
 * File:   main.cpp
 * Author: speedemon
 *
 * Created on October 2, 2009, 7:09 PM
 */
#include <cmath>
#include <ctime>
#include <stdio.h>
#include <cstdlib>
#include <iterator>
#include <algorithm>

using namespace std;
int *v;
inline void swap( unsigned, unsigned );
inline int medianof3( unsigned, unsigned, unsigned );
unsigned partition( unsigned, unsigned, int );
void downheap( unsigned, unsigned );
void HeapSort( unsigned, unsigned );
inline void introsort( unsigned, unsigned, unsigned );
void InsertionSort( unsigned, unsigned );
inline void sort( unsigned, unsigned );
inline void swap( unsigned a, unsigned b )
{int aux=v[a];
	v[a]=v[b];
	v[b]=aux;
}
inline void downheap( unsigned s, unsigned e )
{
	for( unsigned r=2*s+1; r < e; )
	{
		if( r+1 < e && v[r] < v[r+1] ) ++r;
		if( v[r] <= v[s] ) return;
		swap( r, s );
                s=r;
		r=2*s+1;
	}
}
inline void HeapSort( unsigned s, unsigned e )
{
	for( unsigned w=e/2-1; w > s; --w )
		downheap( w, e );
	downheap( s, e );
	for( e-=1; e > s; --e )
	{
		swap( s, e );
		downheap( s, e );
	}
	swap( s, e );
	downheap( s, e );
}
/*              Median of three
a>b|         true        |       false
---+---------------------+----------------------
b>c| true |     false    | true         | false
---+---------------------+----------------------
a>c|  X   | true | false | true | false |  X
---+---------------------+----------------------
   |  b   |  c   |  a    |  a   |  c    |  b
*/
inline int medianof3( unsigned a, unsigned b, unsigned c )
{
    if( v[a] > v[b] )
    {
        if( v[b] > v[c] )
          return v[b];
        else if( v[a] > v[c] )
               return v[c];
        return v[a];
    }
    else if( v[b] > v[c] )
         {
             if( v[a] > v[c] )
               return v[a];
             else return v[c];
         }
    return v[b];
}
unsigned partition( unsigned st, unsigned dr, int x )
{
	while( st < dr )
	{
		while( st < dr && v[st] <= x ) ++st;
		--dr;
		while( st < dr && x <= v[dr] ) --dr;
		if( !( st < dr ) )
			return st;
		swap( st, dr );
		++st;
	}
	return st;
}
inline void introsort( unsigned st, unsigned dr, unsigned depth_limit )
{
	while( dr-st >= 16 )
	{
		if( !depth_limit )
		{
			HeapSort( st, dr );
			return;
		}
		--depth_limit;
		unsigned m=partition( st, dr, medianof3( st, st+(dr-st)/2+1, dr-1 ) );
		introsort( m, dr, depth_limit );
		dr=m;
	}
}
unsigned sorting( int st, int dr )
{srand( time( NULL ) );
   int poz = st + rand() % (dr - st + 1);
   int aux = v[poz]; v[poz] = v[st]; v[st] = aux;
   int x=v[st];
   while( st < dr )
        {while( st < dr && v[dr] >= x) --dr;
         v[st]=v[dr];
         while( st < dr && v[st] <= x) ++st;
         v[dr]=v[st];
        }
   v[st]=x;
   return st;
}
inline void Qsort( int st, int dr )
{
    int m=sorting( st, dr );
    if( m-1 > st ) Qsort( st, m-1 );
    if( m+1 < dr ) Qsort( m+1, dr );
}
inline void sort( unsigned st, unsigned dr )
{
	introsort( st, dr, 2*(unsigned)log((double)dr)/log((double)2) );
	Qsort( st, dr-1 );
}
int main()
{unsigned N,i;
        freopen( "algsort.in", "rt", stdin );
        freopen( "algsort.out", "wt", stdout );
        scanf("%u", &N );
        v=(int*)malloc( N*sizeof(int) );
        for( i=0; i < N; ++i ) scanf("%d", v+i );
	sort( 0, N );
        for( i=0; i < N; ++i ) printf("%d ", *(v+i) );
        free(v);
        return EXIT_SUCCESS;
}