#include <fstream>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");

int n, v[500001], i, m;

void push()
{
    int j=i;
    while(v[j/2]<v[j] && j>1)
    {
        swap(v[j/2], v[j]);
        j/=2;
    }
}

void pop(int &m)
{
    int i=1;
    swap(v[1], v[m]);
    m--;
    while(i<m && (v[i]<v[2*i] || v[i]<v[2*i+1]))
    {
        if(v[i]<v[2*i])
        {
            swap(v[i],v[2*i]);
            i=2*i;
        }
        else
        {
            swap(v[i],v[2*i+1]);
            i=2*i+1;
        }
    }
    for(i=1; i<=m; i++) cout<<v[i]<<" ";
    cout<<endl;
}

int main()
{
    cin>>n;
    for(i=1; i<=n; i++)
    {
        cin>>v[i];
        push();
    }
    for(i=1; i<=n; i++) cout<<v[i]<<" ";
    cout<<endl;
    m=n;
    for(i=1; i<n; i++)
    {
        pop(m);
        //cout<<v[m+1]<<endl;
    }
    for(i=1; i<=n; i++) cout<<v[i]<<" ";
    return 0;
}