// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }
const int N = 3e5;
int s[12], t[12];
signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int a = 0, b = 0, x;
	rep(i, 1, 18) {
		cin >> x;
		++s[x];
		a += x;
	}
	rep(i, 1, 18) {
		cin >> x;
		++t[x];
		b += x;
	}
	s[11] = a, t[11] = b;
	per(i, 11, 1) {
		if(s[i] > t[i]) return cout << "Algosia\n", 0;
		else if(s[i] < t[i]) return cout << "Bajtek\n", 0;
	}
	cout << "remis";
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}
        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  | // #pragma GCC optimize("O3") // #pragma GCC optimize("Ofast") // #pragma GCC optimize("unroll-loops") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #include <bits/stdc++.h> using namespace std; #define PB emplace_back #define int long long #define ll long long #define vi vector<int> #define siz(a) ((int) ((a).size())) #define rep(i, a, b) for (int i = (a); i <= (b); ++i) #define per(i, a, b) for (int i = (a); i >= (b); --i) void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; } const int N = 3e5; int s[12], t[12]; signed main() { // freopen(".in", "r", stdin); // freopen(".out", "w", stdout); ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); int a = 0, b = 0, x; rep(i, 1, 18) { cin >> x; ++s[x]; a += x; } rep(i, 1, 18) { cin >> x; ++t[x]; b += x; } s[11] = a, t[11] = b; per(i, 11, 1) { if(s[i] > t[i]) return cout << "Algosia\n", 0; else if(s[i] < t[i]) return cout << "Bajtek\n", 0; } cout << "remis"; return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0; }  | 
            
        
                    English