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
74
//
// Mateusz Pietrowcow
//
 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
 
#define MOD 1000000007
#define INF 1000000000
#define INFL 1000000000000000000LL
#define Tak cout << "TAK" << '\n'
#define Nie cout << "NIE" << '\n'
#define min3(x, y, z) min(x, min(y, z))
#define max3(x, y, z) max(x, max(y, z))
 
using namespace std;
 
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<long long, long long> pll;
typedef pair<unsigned long long, unsigned long long> pull;

#define A "Algosia"
#define B "Bajtek"
#define R "remis"

const int N = 18;

int la[11], lb[11];
int suma = 0, sumb = 0;

void read()
{
    for (int i = 0; i < N; i++)
    {
        int c;
        cin >> c;
        suma += c;
        la[c]++;
    }

    for (int i = 0; i < N; i++)
    {
        int c;
        cin >> c;
        sumb += c;
        lb[c]++;
    }
}
 
string solve()
{
    if (suma != sumb)
        return (suma > sumb ? A : B);
    for (int i = 10; i >= 1; i--)
    {
        if (la[i] != lb[i])
            return (la[i] > lb[i] ? A : B);
    }

    return R;
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
 
    read();
    cout << solve();
}