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

using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;

#define FOR(x, b, e) for(int x = (b); x <= (e); ++(x))
#define FORD(x, b, e) for(int x = (b); x >= (e); --(x))
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(a, b) for (auto&a : (b))
#define PB push_back
#define PF push_front
#define MP make_pair
#define ST first
#define ND second
#define DBG(vari) cerr<<#vari<<" = "<<(vari)<<endl;

template <typename T>
std::ostream& operator<<(std::ostream &output, const vector<T> &vec)
{
    output << "[";
    FOREACH(x, vec) output << x << ", ";
    output << "]";
    return output;
}

template <typename T, typename U>
std::ostream& operator<<(std::ostream &output, const pair<T,U> &p)
{
    output << "(";
    output << p.ST << ", " << p.ND;
    output << ")";
    return output;
}

void Algosia() {
  cout << "Algosia" << endl;
  exit(0);
}

void Bajtek() {
  cout << "Bajtek" << endl;
  exit(0);
}

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

  const int K=18;
  int sA=0, sB=0;
  vi A(K), B(K);
  vi cntA(10+1, 0), cntB(10+1, 0);

  REP(i, K) {
    cin >> A[i];
    sA += A[i];
    cntA[A[i]]++;
  }

  REP(i, K) {
    cin >> B[i];
    sB += B[i];
    cntB[B[i]]++;
  }

  if (sA > sB)
    Algosia();
  else if (sB > sA)
    Bajtek();
  else
  {
    FORD(i, 10, 1) {
      if (cntA[i] > cntB[i])
        Algosia();
      else if (cntB[i] > cntA[i]) {
        Bajtek();
      }
    }
    cout << "remis" << endl;
  }
}