#include <bits/stdc++.h>

using namespace std;

using LL = long long;
vector<int> cards, hand, up1, up2, down1, down2;
int top = 8;
int trick()
{
    for(int i=0;i<hand.size();i++)
    {
            if(hand[i] < up1.back() && hand[i]+10==up1.back())
            {
                up1.push_back(hand[i]);
                hand.erase(hand.begin()+i);
                return 1;
            }
            if(hand[i] < up2.back() && hand[i]+10==up2.back())
            {
                up2.push_back(hand[i]);
                hand.erase(hand.begin()+i);
                return 1;
            }
            if(hand[i] > down1.back() && hand[i]-10==down1.back())
            {
                down1.push_back(hand[i]);
                hand.erase(hand.begin()+i);
                return 1;
            }
            if(hand[i] > down2.back() && hand[i]-10==down2.back())
            {
                down2.push_back(hand[i]);
                hand.erase(hand.begin()+i);
                return 1;
            }
    }
    return 0;
}

int reg()
{
    int minv = 100, k = -1, w = -1;
    for(int i=0;i<hand.size();i++)
        {
            if(hand[i] > up1.back() && hand[i] - up1.back() < minv)
            {
                minv = hand[i] - up1.back();
                k = i;
                w= 1;
            }
            if(hand[i] > up2.back() && hand[i] - up2.back() < minv)
            {
                minv = hand[i] - up2.back();
                k = i;
                w=2;
            }
            if(hand[i] <down1.back() && down1.back()-hand[i] < minv)
            {
                minv = down1.back()-hand[i];
                k = i;
                w=3;
            }
            if(hand[i] <down2.back() && down2.back()-hand[i] < minv)
            {
                minv = down2.back()-hand[i];
                k = i;
                w=4;
            }
        }
    if(k==-1) return 0;

    if(w == 1) up1.push_back(hand[k]);
    if(w == 2) up2.push_back(hand[k]);
    if(w == 3) down1.push_back(hand[k]);
    if(w == 4) down2.push_back(hand[k]);
    hand.erase(hand.begin()+k);
    return 1;
}

void end()
{
    for(int i : up1) cout << i << ' ';
    cout << '\n';
    for(int i : up2) cout << i << ' ';
    cout << '\n';
    for(int i : down1) cout << i << ' ';
    cout << '\n';
    for(int i : down2) cout << i << ' ';
    cout << '\n';
    for(int i : hand) cout << i << ' ';
    cout << '\n';
    for(int i=top;i<98;i++) cout << cards[i] << ' ';
    cout << '\n';
}

void next_round()
{
    if(top < 98) hand.push_back(cards[top++]);
    if(top < 98) hand.push_back(cards[top++]);
}

int f()
{
    int t = trick();
    if(!t) return reg();
    return t; 
}

void solve()
{
    for(int i=0;i<98;i++)
    {
        int x;
        cin >> x;
        cards.push_back(x);
    }
    up1.push_back(1), up2.push_back(1), down1.push_back(100), down2.push_back(100);
    for(int i=0;i<8;i++) hand.push_back(cards[i]);
    while(hand.size())
    {
        if(f()+f() < 2)
        {
            end();
            return ;
        }
        next_round();
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}