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
#include <bits/stdc++.h>
 
using namespace std;
 
#define endl '\n'
#define L long long
#define MP make_pair
#define REP(i, n) for(int i = 0; i < n; ++i)
#define REPR(i, n) for(int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define FORR(i, a, b) for(int i = b - 1; i >= a; --i)
#define EB emplace_back
#define ST first
#define ND second
#define S size
#define RS resize
 
template<class T> using P = pair<T, T>;
template<class T> using V = vector<T>;
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    V<int> a(18), b(18);
    int sum_a = 0, sum_b = 0;
    REP(i, 18) {
        cin >> a[i];
        sum_a += a[i];
    }
    REP(i, 18) {
        cin >> b[i];
        sum_b += b[i];
    }

    if (sum_a > sum_b) {
        cout << "Algosia\n";
        return 0;
    } else if (sum_b > sum_a) {
        cout << "Bajtek\n";
        return 0;
    }

    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    REPR(i, 18) {
        if (a[i] > b[i]) {
            cout << "Algosia\n";
            return 0;
        } else if (b[i] > a[i]) {
            cout << "Bajtek\n";
            return 0;
        }
    }

    cout << "remis\n";
}