#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int>a[200005];
struct nod {
    int x;
    int dp;
};
stack<nod>pos;
int n,k;
int vis[1000006];
int ans=0;
void dfs(int x,int deep) {
    cout<<x<<" "<<deep<<endl;
    int kk=0;
    if(x!=1&&a[x].size()==1){
        nod pp=pos.top();
        pos.pop();
        int u=0;
        while(!pos.empty()&&pos.top().dp<=pp.dp) {
            u++;
            pos.pop();
            if(u==k){
                ans++;
                u=0;
            }
        }

        if(u!=k&&u!=0)ans++;
        while(!pos.empty()) {
            kk++;
            pos.pop();
            if(kk==k) {
                ans++;
                kk=0;
            }
        }
        deep--;
        return;
    }
    for(int i=0;i<a[x].size();i++) {
        if(!vis[a[x][i]]) {
            vis[a[x][i]]=1;
            cout<<a[x][i]<<" "<<deep<<endl;
            pos.push({a[x][i],++deep});
            dfs(a[x][i],deep);

        }
    }
    deep--;
    return;
}
signed main() {
    int a = 0,b = 0;
    string A,B;
    for(int i = 1;i <= 4; ++i) {
        int x;
        string s;
        cin >> s >> x;
        if( x > a )A = s,a = x;
    }
    for(int i = 1;i <= 4; ++i) {
        int x;
        string s;
        cin >> s >> x;
        if( x > b )B = s,b = x;
    }
    if( a > b )cout << A <<" beats " << B;
    else cout << B <<" beats " << A;
    return 0;
}