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

using namespace std;

string name[5];
int nr, score[5], goal[5], p[5];

inline int find (string a)
{
    for (int i = 1; i <= nr; ++i)
        if (name[i] == a)
            return i;
    name[++nr] = a;
    return nr;
}

inline bool cmp (int a, int b)
{
    if (score[a] != score[b])
        return score[a] > score[b];
    if (goal[a] != goal[b])
        return goal[a] > goal[b];

    for (int i = 0; i < name[a].size () && i < name[b].size (); ++i)
        if (name[a][i] != name[b][i])
            return name[a][i] < name[b][i];
    return name[a].size () < name[b].size();
}

int main ()
{
    //freopen ("date.in", "r", stdin);

    string a, b;
    int sa, sb, na, nb;

    for (int i = 1; i <= 6; ++i)
    {
        cin >> a >> b >> sa >> sb;

        na = find (a);
        nb = find (b);

        goal[na] += sa;
        goal[nb] += sb;

        if (sa > sb)
            score[na] += 3;
        else if (sb > sa)
            score[nb] += 3;
        else
            ++score[na], ++score[nb];
    }
    for (int i = 1; i <= 4; ++i)
        p[i] = i;
    sort (p + 1, p + 5, cmp);

    for (int i = 1; i <= 4; ++i)
        cout << name[p[i]] << '\n';

    return 0;
}