#include #include #include #include using namespace std; unordered_map hm; int main() { string s1, s2; int h, a; vector v; bool g; for (int i = 1; i <= 6; i++) { g = 0; cin >> s1 >> s2 >> h >> a; for (int j = 0; j < v.size(); j++) { if (v[j] == s1) { g = 1; break; } } if (g == 0) { v.push_back(s1); hm[s1] = 0; } g = 0; for (int j = 0; j < v.size(); j++) { if (v[j] == s2) { g = 1; break; } } if (g == 0) { v.push_back(s2); hm[s2] = 0; } if (a == h) { hm[s1]++; hm[s2]++; } if (h > a) { hm[s1] += 3; } if (h < a) { hm[s2] += 3; } } for (int i = 0; i <= 2; i++) { for (int j = i+1; j <= 3; j++) { if (hm[v[j]] < hm[v[i]]) { string aux = v[j]; v[j] = v[i]; v[i] = aux; } } } for (int i = 3; i >= 0; i--) { cout << v[i] << '\n'; } }