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
/* -----------------------
Autor: Tomasz Boguslawski
-------------------------- */
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<fstream>
#include<iomanip>
#include<string>
#include<sstream>
#include<cstring>
#include<map>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include <fstream>
#include<math.h>

#define LL long long
#define FOR(x, b, e) for(LL x = b; x <= (e); x++)
#define FORS(x, b, e, s) for(LL x = b; x <= (e); x+=s)
#define FORD(x, b, e) for(LL x = b; x >= (e); x--)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG if (debug)
#define MIN(a,b) ((a>b)?b:a)
#define MAX(a,b) ((a>b)?a:b)

using namespace std;

int ile_a[11];
int ile_b[11];

/// MAIN
int main(int argc, char* argv[])
{
    // magic formula, which makes streams work faster:
	ios_base::sync_with_stdio(0);
	FOR(i,0,10) { ile_a[i]=0; ile_b[i]=0; };
	int x;
	int a=0;
	FOR(i,1,18)
	{
	    cin >> x;
	    ile_a[x]++;
	    a+=x;
	};
    int b=0;
	FOR(i,1,18)
	{
	    cin >> x;
	    ile_b[x]++;
	    b+=x;
	};
	int wynik=0;
	if (a>b) wynik=1;
	else if (b>a) wynik=2;
    else
    {
        FORD(i,10,1)
        {
            if (ile_a[i]>ile_b[i]) { wynik=1; break; };
            if (ile_b[i]>ile_a[i]) { wynik=2; break; };
        }
    }
    if (wynik==0) cout << "remis\n";
    else if (wynik==1) cout << "Algosia\n";
    else cout << "Bajtek\n";
	return 0;
}