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
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;
const ll M = 1000LL * 1000LL * 1000LL + 7LL;
const int N = 1000 * 1000 + 7;
int tab[20];

void Solve()
{
    int n, x, s = 0;
    n = 18;
    for(int i = 1; i <= n; ++i)
    {
        cin >> x;
        s += x;
        ++tab[x];
    }
    for(int i = 1; i <= n; ++i)
    {
        cin >> x;
        s -= x;
        --tab[x];
    }
    if(s > 0)
    {
        cout << "Algosia\n";
        return;
    }
    if(s < 0)
    {
        cout << "Bajtek\n";
        return;
    }
    for(int i = 10; i >= 0; --i)
    {
        if(tab[i] > 0)
        {
            cout << "Algosia\n";
            return;
        }
        if(tab[i] < 0)
        {
            cout << "Bajtek\n";
            return;
        }
    }
    cout << "remis\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //int t; cin >> t;
    //while(t--)
        Solve();

    return 0;
}