#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
//FILE *f=fopen("tournament.in","r");
using namespace std;
char a[30],b[30];
int nr;

struct elem{
    char s[30];
    int tot;
    int ga;};

elem v[6];

bool egal(char a[],char b[])
{
    int i=0;
    while (a[i]==b[i]) i++;
    if (i>=strlen(a)&&i>=strlen(b)) return true;
    return false;

}
void put1(char a[],int pa,int x)
{
     int i,j;
     for (j=1;j<=nr;j++)
            if (egal(a,v[j].s)==true) {
                    v[j].tot+=pa;
                    v[j].ga+=x;
                    break;
            }
    if (j>nr) {
        nr++;
        strcpy(v[nr].s,a);
        v[nr].tot=pa;
        v[nr].ga=x;
    }

}
bool comp(elem x, elem y)
{
    if (x.tot!=y.tot) return x.tot>y.tot;
    if (x.ga!=y.ga) return x.ga>y.ga;
    int i=0;
    while (i<strlen(x.s)&&i<strlen(y.s)&&x.s[i]==y.s[i]) i++;
    return x.s[i]<y.s[i];


}
int main()
{
    int i,j;
    int x,y,pa,pb;

    for (i=1;i<=6;i++){

            scanf("%s %s %d %d\n",&a,&b,&x,&y);
            if (x>y) {
                pa=3;
                pb=0;
            }else
            if (x==y) {
                pa=1;
                pb=1;
            }else {
                pa=0;
                pb=3;
            }


            put1(a,pa,x);
            put1(b,pb,y);

            memset(a,0,sizeof(a));
            memset(b,0,sizeof(b));
    }
    sort(v+1,v+nr+1,comp);
    for (i=1;i<=nr;i++) cout<<v[i].s<<'\n';

    return 0;
}