#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    vector<string> S(8);
    vector<int> t(8);
    for (int i = 0; i < 8; i++) {
        cin >> S[i] >> t[i];
    }

    auto dfs = [&](auto self, int l, int r) -> int {
        if (r - l == 1) return l;
        int m = (l + r) >> 1;
        int L = self(self, l, m), R = self(self, m, r);
        if (t[L] < t[R]) swap(L, R);
        if (r - l == 8) {
            cout << S[L] << " beats " << S[R] << "\n";
        }
        return L;
    };
    dfs(dfs, 0, 8);
    return 0;
}