#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <cctype>
#include <algorithm>
#include <sstream>

#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <iterator>

using namespace std;

typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;

#define INF 1e9
#define ll long long
#define ull unsigned long long

int main()
{
    //freopen("C:\\Users\\Sonia\\Documents\\mindCoding.ro\\in.txt", "r", stdin);
    int matches = 6;
    string a, b;
    int goalA, goalB;
    map<string, int> mapp;
    int pos = 0;
    int points[4];
    int goals[4];
    memset(points, 0, sizeof(points));
    memset(goals, 0, sizeof(goals));
    vector<pair<pair<int,int>, string> > vec(4);

    while(matches--)
    {
        cin >> a >> b;
        scanf("%d %d", &goalA, &goalB);
        if(mapp.find(a) == mapp.end())
        {
            mapp.insert(make_pair(a,pos));
            pos++;
        }
        if(mapp.find(b) == mapp.end())
        {
            mapp.insert(make_pair(b,pos));
            pos++;
        }

        if(goalA > goalB)
        {
            points[mapp[a]] += 3;
        }
        else if(goalA < goalB)
        {
            points[mapp[b]] += 3;
        }
        else //if(goalA == goalB)
        {
            points[mapp[a]] += 1;
            points[mapp[b]] += 1;
        }
        goals[mapp[a]] += goalA;
        goals[mapp[b]] += goalB;
    }
    map<string, int>::iterator it = mapp.begin();
    int i = 0;
    while(it != mapp.end())
    {
        pos = it->second;
        vec[i++] = make_pair(make_pair(-points[pos], -goals[pos]), it->first);
        it++;
    }

    sort(vec.begin(), vec.end());
    for(int i = 0; i < 4; i++)
    {
        cout << vec[i].second << endl;
    }

    return 0;
}