#include <iostream>
#include <limits.h>
#include <cmath>
#include <string>
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
#include <vector>
#include <stack>
#include <map>
#include <fstream>

using namespace std;

int x,y,i,j,n=6;
string a,b;
map <string,int> s,m,q,apa;
vector <string> all;

int main(){

    for(i=1; i<=n; i++)
    {
        cin>>a>>b>>x>>y;

        if (apa[a] == 0 ) { apa[a] = 1; all.push_back(a); }
        if (apa[b] == 0 ) { apa[b] = 1; all.push_back(b); }

        if (x>y) s[a] += 3;
        if (x<y) s[b] += 3;
        if (x==y) { s[a]+=1; s[b]+=1;  }

        q[a] += x;
        q[b] += y;
    }


    for(i=0; i<all.size(); i++)
        for(j=i+1; j<all.size() - 1; j++)
            if ( s[all[i]] > s[all[j]])
    {
        swap(all[i], all[j]);
        swap(s[all[i]], s[all[j]]);
        swap(q[all[i]] , q[all[j]]);
    }
    else
        if ( s[all[i]] == s[all[j]] and  q[all[i]] != q[all[j]])
        {
            if (q[all[i]] > q[all[j]])
                {
                    swap(all[i], all[j]);
                    swap(q[all[i]] , q[all[j]]);
                }
        }
        else
           if ( s[all[i]] == s[all[j]] and  q[all[i]] == q[all[j]] )
                if (all[i] > all[j])
                        swap(all[i], all[j]);



    for(i=all.size() - 1; i>=0; i--)
        cout<<all[i]<<endl;

    return 0;
}