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
77
78
79
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
 
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define debug(x...)
#endif
 
const ll mod = 1e9+7;
const int infi  = 1e9+1;
const ld eps = 1e-10L;
 
int main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int algosia = 0, bajtek = 0;
	map<int,int> algo, baj;
	for(int i=0;i<18;i++){
		int x; cin >> x;
		algosia += x;
		algo[x]++;
	}
	for(int i=0;i<18;i++){
		int x; cin >> x;
		bajtek += x;
		baj[x]++;
	}
	// debug(bajtek, algosia)
	if(algosia > bajtek){
		cout << "Algosia" << '\n';
	} else if(algosia < bajtek){
		cout << "Bajtek" << '\n';
	} else {
		for(int i=10;i>=0;i--){
			if(baj[i] < algo[i]){
				cout << "Algosia" << '\n';
				return 0;
			} else if(baj[i] > algo[i]) {
				cout << "Bajtek" << '\n';
				return 0;
			}
		}
		cout << "remis" << '\n';
	}

	return 0;
}