#include <cstdio>
#include <map>
#include <algorithm>
#include <string>
#include <iostream>

using namespace std;

string t1, t2;
int g1, g2;
map<string, int> points, goals;
pair<int, pair<int, string> > data[4];

int main()
{
   // freopen("data.in", "r", stdin);
    for(int i=0; i<6; ++i)
    {
        cin>>t1>>t2>>g1>>g2;

        goals[t1]=goals[t1]+g1;
        goals[t2]=goals[t2]+g2;

        if(g1>g2)
            points[t1] = points[t1]+3;
        if(g1<g2)
            points[t2] = points[t2]+3;
        if(g1==g2)
        {
            points[t1] = points[t1]+1;
            points[t2] = points[t2]+1;
        }
    }

    int x=0;

    for(map<string, int> :: iterator it = goals.begin(); it != goals.end(); ++it)
        data[x++]=make_pair(-points[it->first], make_pair(-(it->second), it->first));

    sort(data, data+4);

    for(int i=0; i<4; ++i)
        cout<<data[i].second.second<<"\n";

    return 0;
}