#pragma GCC optimize ("O3")
#include<bits/stdc++.h>
using namespace std;

#define FOR(i, n) for (int i = 0; i < n; i++)
#define f first
#define s second
#define pb push_back
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()

using vi = vector<int>;

void solve()
{
    vi a(18), b(18);
    FOR (i, 18)
    {
        cin >> a[i];
    }

    FOR (i, 18)
    {
        cin >> b[i];
    }

    sort(all(a));
    sort(all(b));
    reverse(all(a));
    reverse(all(b));

    int A = accumulate(all(a), 0);
    int B = accumulate(all(b), 0);

    if (a == b)
    {
        cout << "remis\n";
        return;
    }
    else if (A > B or (A == B and a > b))
    {
        cout << "Algosia\n";
    }
    else
    {
        cout << "Bajtek\n";
    }
}

int main () {
    ios::sync_with_stdio(0);
    cin.tie(0);

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

    for (int test = 1; test <= tests; test++) {
        solve();
    }

    return 0;
}