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
#include <bits/stdc++.h>

using namespace std;

const int N = 18;


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

    int alg[N], baj[N];
    int dif = 0;
    
    for(int i = 0; i < N; i++) cin >> alg[i];
    for(int i = 0; i < N; i++) cin >> baj[i];
    for(int i = 0; i < N; i++) {
        dif += alg[i] - baj[i];
    }
    
    
    if(dif == 0) {
        sort(alg, alg+N, greater<int>());
        sort(baj, baj+N, greater<int>());
        
        for(int i = 0; i < N; i++) {
            if(alg[i] > baj[i]) {
                dif = 1;
                break;
            }
            if(alg[i] < baj[i]) {
                dif = -1;
                break;    
            }
        }
    }
    
    if(dif > 0) cout << "Algosia" << "\n";
    else if(dif < 0) cout << "Bajtek" << "\n";
    else cout << "remis" << "\n";
    
    
	
    return 0;
}