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


char c[5][101];
pair <int, pair <int,int> > v[5];
int nr;

void adauga(char *s, int nnr)
{
	int i;
	for(i=1;i<=nr;i++)
		if(strcmp(c[i],s)==0) {
			v[i].second.first+=nnr;
			return ;
		}
	nr++;
	strcpy(c[nr],s);
	v[nr].first=nr;
	v[nr].second.first=nnr;
}

void adauga2(char *s, int nnr)
{
	int i;
	for(i=1;i<=nr;i++)
		if(strcmp(c[i],s)==0) {
			v[i].second.second+=nnr;
			return ;
		}
	nr++;
	strcpy(c[nr],s);
	v[nr].first=nr;
	v[nr].second.second=nnr;
}

struct cmp {
	bool operator () (const pair <int, pair <int,int> > a, const pair <int, pair <int,int> > b) const {
		if(a.second.first==b.second.first) {
			if(a.second.second==b.second.second)
				return strcmp(c[a.first],c[b.first]);
			else return a.second.second>b.second.second;
		}
		return a.second.first>b.second.first;
	}
};

int main ()
{
	char a[101],b[101];
	int i,x,y;
	//freopen("code.in","r",stdin);
	nr=0;
	for(i=1;i<=6;i++) {
		scanf("%s%s%d%d",a,b,&x,&y);
		if(x>y)
			adauga(a,3);
		else if(x<y)
			adauga(b,3);
		else {
			adauga(a,1);
			adauga(b,1);
		}
		adauga2(a,x);
		adauga2(b,y);
	}
	sort(v+1,v+nr+1,cmp());
	for(i=1;i<=nr;i++) 
		printf("%s\n",c[v[i].first]);
	return 0;
}