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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;

using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;


void solve(int _id) {
    vector<int> A(18), B(18);

    for (int i = 0; i < 18; i++)
        cin >> A[i];
    for (int i = 0; i < 18; i++)
        cin >> B[i];

    int sumA = accumulate(A.begin(), A.end(), 0);
    int sumB = accumulate(B.begin(), B.end(), 0);

    vector<int> occA(11), occB(11);
    for (int i : A)
        occA[10 - i]++;
    for (int i : B)
        occB[10 - i]++;

    if (sumA != sumB) {
        cout << (sumA > sumB ? "Algosia" : "Bajtek") << "\n";
        return;
    } else {
        if (occA > occB) {
            cout << "Algosia\n";
            return;
        }

        if (occA < occB) {
            cout << "Bajtek\n";
            return;
        }

        cout << "remis\n";
        return;
    }

}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
//    freopen("../d/1.in","r",stdin);
//    freopen("../wzo.out","w",stdout);

//    cin >> t;

    for (int i = 1; i <= t; i++) {
        solve(i);
    }

    return 0;
}
/*
1
cc
1
1 1

a
ca
cca
 */