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
#include <bits/stdc++.h>
#ifdef LOC
#include "debuglib.h"
#else
#define deb(...)
#define DBP(...)
#endif
using namespace std;
using   ll         = long long;
using   vi         = vector<int>;
using   pii        = pair<int, int>;
#define pb           push_back
#define mp           make_pair
#define x            first
#define y            second
#define rep(i, b, e) for (int i = (b); i < (e); i++)
#define each(a, x)   for (auto& a : (x))
#define all(x)       (x).begin(), (x).end()
#define sz(x)        int((x).size())

int solve() {
	array<int, 18> A, B;
	each(e, A) cin >> e;
	each(e, B) cin >> e;

	int sa = accumulate(all(A), 0);
	int sb = accumulate(all(B), 0);
	if (sa != sb) return sa < sb ? -1 : 1;

	for (int i = 10; i >= 0; i--) {
		int ca = count(all(A), i);
		int cb = count(all(B), i);
		if (ca != cb) return ca < cb ? -1 : 1;
	}

	return 0;
}

int main() {
	switch (solve()) {
		case -1:
			cout << "Bajtek\n";
			break;
		case 0:
			cout << "remis\n";
			break;
		case 1:
			cout << "Algosia\n";
			break;
	}
}