#include<stdio.h>
#include<algorithm>
#include<cstring>
using namespace std;

int n;
int p[10],g[10],ind[10];
char s[10][105],aux[105];

int number()
{
    for(int i=1;i<=n;i++)
     if(strcmp(s[i]+1,aux+1)==0)
      return i;

    n++; strcpy(s[n]+1,aux+1);
    return n;
}

bool cmp(const int &a,const int &b)
{
    int k;
    if(p[a]==p[b])
    {
        if(g[a]==g[b])
        {
            k=strcmp(s[a]+1,s[b]+1);
            if(k<0) return 1;
            return 0;
        }
        else return g[a]>g[b];
    }
    else return p[a]>p[b];
}

void read()
{
    int indx,indy,x,y;
    for(int i=1;i<=6;i++)
    {
        scanf("%s ",aux+1); indx=number();
        scanf("%s ",aux+1); indy=number();

        scanf("%d %d\n",&x,&y);

        g[indx]+=x; g[indy]+=y;

        if(x>y) p[indx]+=3;
        else
         if(x<y) p[indy]+=3;
         else
          if(x==y) p[indx]++,p[indy]++;
    }
}

void print()
{
    for(int i=1;i<=n;i++)
     printf("%s\n",s[ind[i]]+1);
}

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

    read();

    for(int i=1;i<=6;i++) ind[i]=i;
    sort(ind+1,ind+n+1,cmp);
    print();

    fclose(stdin);
    fclose(stdout);
    return 0;
}