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

/*
 * 
 */
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] < H[son+1] )
            ++son;
        if( H[k] >= H[son] )
            return;
        swap( H[k], H[son] );
    }
}
inline void HeapSort( int left, int right )
{
    int i;
    for( i=left+(right-left)/2; i >= left; --i )
        DownHeap( i, right );
    for( ; right >= left; )
    {
        swap( H[left], H[right] );
        --right;
        DownHeap( left, right );
    }
}
int main(int argc, char** argv)
{
    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);
}