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
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
typedef pair<int,int> pii;
const ll INFLL=1e18+7;
const int INF=1e9+7;
#define pb push_back
int main()
{
	ios_base::sync_with_stdio(0);
	vector<int> cnt1(11), cnt2(11);
    int total = 0;
    for(int i=1;i<=18;++i){
        int x; cin>>x;
        ++cnt1[x];
        total += x;
    }
    for(int i=1;i<=18;++i){
        int x; cin>>x;
        ++cnt2[x];
        total -= x;
    }
    if(total < 0) cout<<"Bajtek\n";
    else if(total > 0) cout<<"Algosia\n";
    else{
        for(int i=10;i>=0;--i){
            if(cnt1[i] > cnt2[i]){
                cout<<"Algosia\n";
                return 0;
            }
            if(cnt1[i] < cnt2[i]){
                cout<<"Bajtek\n";
                return 0;
            }
        }
        cout<<"remis\n";
    }
}