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
75
76
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <chrono>
#include <map>
#include <assert.h>
#include <fstream>
#include <cstdlib>
#include <random>
#include <iomanip>
#include <queue>
#include <random>
#include <unordered_map>
 
using namespace std;

#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()

const int MOD = (int) 1e9 + 7;

void solve() {
    int n = 18;

    vector<int> a(n), b(n);
    int sum[2] = {0, 0};
    vector<vector<int> > k(2, vector<int>(11, 0));
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        sum[0] += a[i];

        ++k[0][a[i]];
    }
    for (int i = 0; i < n; ++i) {
        cin >> b[i];
        sum[1] += b[i];

        ++k[1][b[i]];
    }

    if (sum[0] > sum[1]) {
        cout << "Algosia\n";
        return;
    } else if (sum[0] < sum[1]) {
        cout << "Bajtek\n";
        return;
    }

    for (int i = 10; i >= 0; --i) {
        if (k[0][i] > k[1][i]) {
            cout << "Algosia\n";
            return;
        } else if (k[0][i] < k[1][i]) {
            cout << "Bajtek\n";
            return;
        }        
    }

    cout << "remis\n";
}

int main() {
    // freopen("input.txt", "r", stdin);
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int tests = 1;
    // cin >> tests;

    for (int i = 0; i < tests; ++i) {
        solve();
    }
}