// #pragma GCC optimize(3)
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("inline")
// #pragma GCC optimize("omit-frame-pointer")

#include<bits/stdc++.h>
// #include<bits/extc++.h>

#define rep(a,b,c) for (int a=b;a<=c;a++)
#define repll(a,b,c) for (LL a=b;a<=c;a++)
#define per(a,b,c) for (int a=b;a>=c;a--)
#define perll(a,b,c) for (LL a=b;a>=c;a--)
#define repIt(it,ctner) for (auto it=ctner.begin();it!=ctner.end();it++)
#define perIt(it,ctner) for (auto it=ctner.rbegin();it!=ctner.rend();it++)
#define repAdj(i,h,ne,u) for(int i=h[u];i;i=ne[i])
#define setValue(ctner,val) memset(ctner,val,sizeof ctner)
#define all(ctner) ctner.begin(),ctner.end()

#define output(a,b,c) cout<<a<<" "<<b<<" "<<c<<"\n";


#define ft first
#define sd second
 
using namespace std;
// using namespace __gnu_cxx;
// using namespace __gnu_pbds;
typedef long long LL;
typedef long long ll;
typedef unsigned long long ULL;
typedef unsigned long long ull;
typedef __int128 LLL;
typedef __int128 lll;
typedef long double LD;
typedef pair<LL,LL> PLL;
typedef pair<int,int> PII;
typedef pair<int,LL> PIL;
typedef pair<LL,int> PLI;
typedef pair<double,int> PDI;
typedef vector<int> VI;

//use cin
void LLLread(LLL &x){
    string s;cin>>s;
    x=0;int f=1;
    if(s[0]=='-') f=-1,s=s.substr(1);
    for(auto c:s) x=x*10+c-'0';
    x*=f;

}
//use cout
void LLLwrite(LLL x){
    if(x<0) cout<<'-',x=-x;
    if(x==0) cout<<0;
    vector<char> v;
    while(x) v.push_back(x%10+'0'),x/=10;
    reverse(v.begin(),v.end());
    for(auto c:v) cout<<c;
}

ostream& operator<<(ostream& os,const LLL& x){
    LLLwrite(x);
    return os;
}

istream& operator>>(istream& is,LLL& x){
    LLLread(x);
    return is;
}



//random
LL rnd(const LL &mn = 0, const LL &mx = 100) {
    LL x = mn + ((rand()<<15) + rand()) % (mx - mn + 1);
    return x;
};

//gcd
LL gcd(LL a,LL b){
    return __gcd(a,b);
}
//lcm
LL lcm(LL a,LL b){
    return a/__gcd(a,b)*b;
}






 
int _T=1;
const int N=2e6+5,M=3*N;
const LL mod1=998244353,mod2=1e9+7;
const int imod[4]={39983,39989,39979,39971};
const LL MAXLL=1e18;
const int MAXINT=1e9+1;
const long double pi=acos(-1.0);
const long double eps=1e-10; 
//const double phi=(1+sqrt(5))/2;
const string alphabet="abcdefghijklmnopqrstuvwxyz";
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const LL mod=mod2;





void init(){

}


int highbit(LL x){
    return 63-__builtin_clzll(x);
}

struct node{
    string name;
    int v;
}a[9],b[5],c[3];

node battle(node x,node y){
    if(x.v>y.v) return x;
    else return y;
}

void beat(node x,node y){
    if(x.v<y.v) swap(x,y);
    cout<<x.name<<" beats "<<y.name<<"\n";
}


void solve(){
    rep(i,1,8){
        cin>>a[i].name>>a[i].v;
    }
    rep(i,1,4){
        b[i]=battle(a[i*2-1],a[i*2]);
    }
    rep(i,1,2){
        c[i]=battle(b[i*2-1],b[i*2]);
    }
    beat(c[1],c[2]);


}

int main(){

    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);


    srand(time(0));





    init();
    // cin>>_T;
    rep(i,1,_T){
        solve();
    }


    return 0;
}