#include<bits/stdc++.h>
#define LL long long
#define LLL __int128
#define uint unsigned
#define ldb long double
#define uLL unsigned long long
using namespace std;
tuple<string,string>A[16];
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    for(int i=0;i<16;++i){
        string s,t;cin>>s>>t;
        if(t.find('0')!=t.npos){
            if(t.find('0')==t.length()-1);
            else if(t[t.find('0')+1]=='1')
                t.erase(t.find('0'),2);
            else t[t.find('0')]='0'-1;
        }
        else t="2";
        // cout<<t<<endl;
        A[i]=make_tuple(t,s);
    }
    sort(A,A+16,greater<>());
    cout<<"1 "<<get<1>(A[0])<<'\n';
    cout<<"2 "<<get<1>(A[1])<<'\n';
    cout<<"3 "<<get<1>(A[2])<<'\n';
    cout<<"4 "<<get<1>(A[3])<<'\n';
    sort(A+4,A+6,[&](tuple<string,string>x,tuple<string,string>y){return get<1>(x)<get<1>(y);});
    cout<<"5-6 "<<get<1>(A[4])<<'\n';
    cout<<"5-6 "<<get<1>(A[5])<<'\n';
    sort(A+6,A+8,[&](tuple<string,string>x,tuple<string,string>y){return get<1>(x)<get<1>(y);});
    cout<<"7-8 "<<get<1>(A[6])<<'\n';
    cout<<"7-8 "<<get<1>(A[7])<<'\n';
    sort(A+8,A+12,[&](tuple<string,string>x,tuple<string,string>y){return get<1>(x)<get<1>(y);});
    cout<<"9-12 "<<get<1>(A[8])<<'\n';
    cout<<"9-12 "<<get<1>(A[9])<<'\n';
    cout<<"9-12 "<<get<1>(A[10])<<'\n';
    cout<<"9-12 "<<get<1>(A[11])<<'\n';
    sort(A+12,A+16,[&](tuple<string,string>x,tuple<string,string>y){return get<1>(x)<get<1>(y);});
    cout<<"13-16 "<<get<1>(A[12])<<'\n';
    cout<<"13-16 "<<get<1>(A[13])<<'\n';
    cout<<"13-16 "<<get<1>(A[14])<<'\n';
    cout<<"13-16 "<<get<1>(A[15])<<'\n';
    return 0;
}
/*
*/