#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;

int main() {
  map<string, pair<int, int> > m;

  string teamA, teamB;
  int gA, gB;

  for (int i = 1; i <= 6; i += 1) {
    cin >> teamA >> teamB >> gA >> gB;
    int pA = 0, pB = 0;
    if (gA > gB) {
      pA = 3;
    } else if (gA < gB) {
      pB = 3;
    } else {
      pA = pB = 1;
    }

    pair<int, int> pgA, pgB;
    pgA = m[teamA];
    pgB = m[teamB];

    m[teamA] = make_pair(pgA.first + pA, pgA.second + gA);
    m[teamB] = make_pair(pgB.first + pB, pgB.second + gB);
  }

  typedef pair<string, pair<int, int> > psp;
  vector<psp> sB;
  for (auto kv: m) {
    sB.push_back(kv);
  }

  sort(sB.begin(), 
       sB.end(), 
       [](const psp &a, const psp &b) {
          if (a.second == b.second) return a.first < b.first;
          return a.second > b.second;
       });

  for (auto t: sB) {
    cout << t.first << '\n';
  }

  return 0;
}