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

/*
 * 
 */
using namespace std;
int N;
int v[Nmax];
inline void swap( int& x, int& y )
{
    int aux=x;
    x=y;
    y=aux;
}
inline void DownHeap( int k )
{
    for( int son=2*k; son <= N; k=son, son=2*k )
    {
        if( son < N && v[son+1] > v[son] )
            ++son;
        if( v[son] <= v[k] )
            return;
        swap( v[k], v[son] );
    }
}
inline void UpHeap( int k )
{
    for( int key=v[k], f=k/2; k > 1 && key > v[f]; k=f, f/=2 )
        swap( v[k], v[f] );
}
inline void HeapSort( void )
{
    int i;
    for( i=N/2; i > 0; --i )
        DownHeap(i);
    while( N )
    {
        swap( v[1], v[N] );
        --N;
        DownHeap( 1 );
    }
}
int main(int argc, char** argv)
{
    int n;
    ifstream in( "algsort.in" );
    in>>N;
    n=N;
    copy( istream_iterator<int>(in), istream_iterator<int>(), v+1 );
    HeapSort();
    ofstream out( "algsort.out" );
    copy( v+1, v+n+1, ostream_iterator<int>( out, " " ) );
    out<<'\n';
    return EXIT_SUCCESS;
}