1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define pb emplace_back
#define ins insert
#define mp make_pair
#define ssize(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pld pair <ld, ld>
#define st first
#define nd second

using namespace std;
using ll = int_fast64_t;
// using lll = __int128_t;
using ld = long double;
const int oo = 1e9 + 7;
const ll ool = 1e18;
const int mod = 1e9 + 7;

void solve(){
    vector tab(2, vector<int>(11, 0));
    int sa = 0, sb = 0;
    for(int i = 0; i < 18; i ++){
        int x; cin >> x;
        sa += x;
        ++ tab[0][x];
    }
    for(int i = 0; i < 18; i ++){
        int x; cin >> x;
        sb += x;
        ++ tab[1][x];
    }
    if(sa != sb){
        if(sa > sb) cout << "Algosia\n";
        else cout << "Bajtek\n";
        exit(0);
    }
    for(int i = 10; i >= 0; i --){
        if(tab[0][i] != tab[1][i]){
            if(tab[0][i] > tab[1][i]) cout << "Algosia\n";
            else cout << "Bajtek\n";
            exit(0);
        }
    }
    cout << "remis\n";
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t; t = 1;
    // cin >> t;
    while(t --) solve();
    return 0;
}