#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

struct echipa{
    char s[102];
    int nrgoluri;
    int points;
}v[1000];
char a[102],b[102];
int x,y,k;
int cmp(echipa a,echipa b){
    return a.points>b.points || (a.points==b.points && a.nrgoluri>b.nrgoluri) || (a.points==b.points && a.nrgoluri>b.nrgoluri && strcmp(a.s,b.s)<0);
}
int main(){
    while(cin>>a>>b>>x>>y){
        int ok1,ok2;
        ok1=ok2=0;
        for(int i=1;i<=k && (!ok1 || !ok2);i++){
            if(strcmp(a,v[i].s)==0){
                v[i].nrgoluri+=x;
                if(x>y)
                    v[i].points+=3;
                if(x==y)
                    v[i].points+1;
                    ok1=1;
            }
            if(strcmp(b,v[i].s)==0){
                v[i].nrgoluri+=y;
                if(y>x)
                    v[i].points+=3;
                if(y==x)
                    v[i].points+1;
                    ok2=1;
            }
        }
        if(!ok1){
            strcpy(v[++k].s,a);
            if(x>y)
                v[k].points+=3;
            if(x==y)
                v[k].points+1;
            v[k].nrgoluri+=x;
        }
        if(!ok2){
            strcpy(v[++k].s,b);
            if(y>x)
                v[k].points+=3;
            if(x==y)
                v[k].points+1;
            v[k].nrgoluri+=y;
        }
    }
    sort(v+1,v+k+1,cmp);
    for(int i=1;i<=k;i++)
        cout<<v[i].s<<"\n";
}