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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <unistd.h>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <deque>
#include <iostream>
#include <algorithm>

// using namespace std;
#define REP(i, n) for (int _n = (n), i = 0; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
#define TRACE(x) cerr << "TRACE(" #x ")" << endl;
#define DEBUG(x) cerr << #x << " = " << (x) << endl;
typedef long long LL;
typedef unsigned long long ULL;
using VINT = std::vector<int>;
using VLL = std::vector<LL>;
using VULL = std::vector<ULL>;

VLL get()
{
  VLL vll;
  int a;
  vll.resize(10, 0);
  for (int i = 0; i < 18; i++)
  {
    std::cin >> a;
    vll[a]++;
  }
  return vll;
}

int main()
{
  std::ios_base::sync_with_stdio(false);

  VLL vll1;
  int a;
  int sum1 = 0;
  vll1.resize(11, 0);
  for (int i = 0; i < 18; i++)
  {
    std::cin >> a;
    vll1[a]++;
    sum1 += a;
  }

  VLL vll2;
  int sum2 = 0;
  vll2.resize(11, 0);
  for (int i = 0; i < 18; i++)
  {
    std::cin >> a;
    vll2[a]++;
    sum2 += a;
  }

  if (sum1 > sum2)
  {
    std::cout << "Algosia" << std::endl;
    return 0;
  }
  else if (sum1 < sum2)
  {
    std::cout << "Bajtek" << std::endl;
    return 0;
  }
  else
  {
    for (int i = 10; i >= 0; i--)
    {
      if (vll1[i] > vll2[i])
      {
        std::cout << "Algosia" << std::endl;
        return 0;
      }
      else if (vll1[i] < vll2[i])
      {
        std::cout << "Bajtek" << std::endl;
        return 0;
      }
    }
  }

  std::cout << "remis" << std::endl;
  return 0;
}