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
#include <bits/stdc++.h>

using namespace std;
using LL = long long;
#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define ssize(x) int(x.size())

template<class A, class B> auto &operator<<(ostream &o, pair<A, B> p) {
    return o << '(' << p.first << ", " << p.second << ')';
}

template<class T> auto operator<<(ostream &o, T x) -> decltype(x.end(), o) {
    o << '{'; int i = 0; for (auto e : x) o << (", ")+2*!i++ << e;
    return o << '}';
}

#ifdef DEBUG
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n';
#else
#define debug(...) {}
#endif


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    constexpr int N = 18;
    vector<int> a(N), b(N);
    int sa = 0, sb = 0;
    REP(i, N) {
        cin >> a[i];
        sa += a[i];
    }
    REP(i, N) {
        cin >> b[i];
        sb += b[i];
    }
    if (sa != sb) {
        cout << (sa > sb ? "Algosia\n" : "Bajtek\n");
        return 0;
    }

    sort(a.begin(), a.end(), greater<>());
    sort(b.begin(), b.end(), greater<>());
    REP(i, N) {
        if (a[i] != b[i]) {
            cout << (a[i] > b[i] ? "Algosia\n" : "Bajtek\n");
            return 0;
        }
    }
    cout << "remis\n";

    return 0;
}