/*
    Look at me!
    Look at me!
    Look at how large the monster inside me has become!
*/

#include<fstream>
#include<iostream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define mod 1000000007
#define MOD 32416190071
#define N 500100
#define SQR 350
#define inf 1<<30
#define div pula
#define hash pizda
using namespace std;

pair<int,pair<int,string> > v[10];
string a[10],b[10];
map<string,int> P,G,viz;
int x,t,y;

int main ()
{
    #ifndef ONLINE_JUDGE
    freopen("a.in","r",stdin);
    freopen("a.out","w",stdout);
    #endif

    FOR(i,1,6)
    {
        f>>a[i]>>b[i];
        f>>x>>y;
        if(x>y)
            P[a[i]]-=3;
        else
        if(x<y)
            P[b[i]]-=3;
        else
        {
            P[a[i]]--;
            P[b[i]]--;
        }
        G[a[i]]-=x;
        G[b[i]]-=y;
    }
    FOR(i,1,6)
    {
        if(!viz[a[i]])
        {
            viz[a[i]]=1;
            v[++t]=mp(P[a[i]],mp(G[a[i]],a[i]));
        }
        if(!viz[b[i]])
        {
            viz[b[i]]=1;
            v[++t]=mp(P[b[i]],mp(G[b[i]],b[i]));
        }
    }
    sort(v+1,v+t+1);
    FOR(i,1,t)
    g<<v[i].se.se<<"\n";
    return 0;
}