# include <bits/stdc++.h>
using namespace std;
# define fi cin
# define fo cout
# define x first
# define y second
map < string , int > s;
map < string , int > p;
pair < string , pair < int , int > > v[10005];
bool cmp(pair < string , pair < int , int > > a , pair < string , pair < int , int > > b)
{
    if (a.y.x == b.y.x)
    {
        if (a.y.y == b.y.y) return (a.x < b.x);
        return a.y.y > b.y.y;
    }
    return a.y.x > b.y.x;
}
int main(void)
{
     string a,b;
     int k,l;
     while (fi>>a>>b>>k>>l)
     {
         if (a == "" || b == "") break;
         if (!s[a]) s[a] = 1;
         if (!s[b]) s[b] = 1;
         if (k == l) ++s[a],++s[b];
         else if (k > l) s[a] += 3;else s[b] += 3;
         p[a] += k;p[b] += l;
     }
     int n=0;
     for (map < string , int > ::iterator it = s.begin();it != s.end();++it)
           v[++n].x = it->x,v[n].y.x = it->y,v[n].y.y=p[it->x];
     sort(v+1,v+1+n,cmp);
     for (int i=1;i<=n;++i) fo << v[i].x << '\n';
     return 0;
}