#include <iostream>
#include <fstream>

using namespace std;

/*
    MinHeap
*/

#define Hmax 500005

#define Parent(i) i/2
#define LeftSon(i) 2*i
#define RightSon(i) 2*i+1

void InitHeap( int *H )
{
    for ( int i = 0; i < Hmax; ++i )
            H[i] = 0;
}

void DownHeap( int *H, int N, int poz )
{
    int k = poz;
    int j;

    do
    {
        j = k;

        if ( LeftSon(j) <= N && H[LeftSon(j)] < H[k] )   k = LeftSon(j);
        if ( RightSon(j) <= N && H[RightSon(j)] < H[k] ) k = RightSon(j);

        swap( H[j], H[k] );

    } while( j != k );
}

void UpHeap( int *H, int N, int poz )
{
    int k = poz;
    int j;

    do
    {
        j = k;

        if ( j > 1 && H[Parent(j)] > H[k] ) k = Parent(j);

        swap( H[j], H[k] );

    } while( j != k );
}

void InsertHeap( int *H, int &N, int key )
{
    H[ ++N ] = key;

    UpHeap( H, N, N );
}

void DeleteMin( int *H, int &N )
{
    H[1] = H[N];

    DownHeap( H, N, 1 );

    N--;
}

void ChangeValueHeap( int *H, int N, int poz, int key )
{
    int val = H[poz];
    H[poz] = key;

    UpHeap( H, N, poz );
    DownHeap( H, N, poz );
}

void MakeHeap( int *H, int N )
{
    for ( int i = N/2; i >= 1; i-- )
            DownHeap( H, N, i );
}

void HeapSort( int *H, int N )
{
    //MakeHeap( H, N );

    for ( int i = N; i >= 2; i-- )
    {
        swap( H[i], H[1] );
        DownHeap( H, i - 1, 1 );
    }
}

int main()
{
    int H[Hmax], N = 0, n;

    ifstream f("algsort.in");
    ofstream g("algsort.out");

    f >> n;

    for ( int i = 1, a; i <= n; i++ )
    {
        f >> a;
        InsertHeap( H, N, a );
    }

    HeapSort(H,n);

    for ( int i = N; i >= 1; i-- )
            g << H[i] << " ";

    return 0;
}