#include <cstdlib>
#include <fstream>
#include <iterator>
#define Nmax 500111

/*
 *
 */
using namespace std;
int H[Nmax];
inline void DownHeap( int k, int N )
{
    for( int son=2*k; son <= N; k=son, son*=2 )
    {
        if( son < N && H[son+1] > H[son] )
            ++son;
        if( H[k] >= H[son] )
            return;
        swap( H[k], H[son] );
    }
}
inline void HeapSort( int start, int end )
{
    for( int i=(end-start+1)/2; i >= start; --i )
        DownHeap( i, end );
    while( end )
    {
        swap( H[1], H[end] );
        --end;
        DownHeap( 1, end );
    }
}

int main( void )
{
    int N;
    ifstream in( "algsort.in" );
    in>>N;
    copy( istream_iterator<int>(in), istream_iterator<int>(), H+1 );
    HeapSort( 1, N );
    ofstream out( "algsort.out" );
    copy( H+1, H+N+1, ostream_iterator<int>(out, " " ) );
    out<<'\n';
    return EXIT_SUCCESS;
}