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

#define f first
#define s second
#define mp make_pair

using namespace std;

pair <int, pair <int, string> > s1[8];
string s2, s3;

int main ()
{
    int k = 0;
    for (int i = 1; i <= 6; ++i)
    {
        int sc1, sc2;
        cin >> s2 >> s3 >> sc1 >> sc2;

        int pct1 = 0, pct2 = 0;
        if (sc1 == sc2) pct1 = pct2 = 1;
        else if (sc1 < sc2) pct2 = 3;
        else pct1 = 3;

        int p1 = -1, p2 = -1;
        for (int j = 1; j <= k; ++j)
        {
            if (s1[j].s.s == s2) p1 = j;
            if (s1[j].s.s == s3) p2 = j;
        }

        if (p1 == -1) s1[++k] = mp (pct1, mp (sc1, s2));
        else s1[p1].f += pct1, s1[p1].s.f += sc1;

        if (p2 == -1) s1[++k] = mp (pct2, mp (sc2, s3));
        else s1[p2].f += pct2, s1[p2].s.f += sc2;
    }

    sort (s1 + 1, s1 + k + 1);

    for (int i = k; i; --i)
        cout << s1[i].s.s << '\n';

    return 0;
}