#include <bits/stdc++.h>
using namespace std;
const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};
const double EPS = 1e-8;
const double PI = acos(-1.0);
int popcount(int n) { return __builtin_popcount(n); }
int popcount(unsigned long long n) { return __builtin_popcountll(n); }
template <class T>
int SIZE(T a) {
  return a.size();
}
template <class T>
string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T>
T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++) res = (res * 10 + str[i] - '0');
  return res;
}
template <class T>
T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
void PrintSeq(T &a, int sz) {
  for (int i = 0; i < sz; i++) {
    cout << a[i];
    if (sz == i + 1)
      cout << endl;
    else
      cout << ' ';
  }
}
bool EQ(double a, double b) { return abs(a - b) < EPS; }
bool EQV(complex<double> a, complex<double> b) {
  return EQ(a.real(), b.real()) & EQ(a.imag(), b.imag());
}
void fastStream() {
  cin.tie(0);
  std::ios_base::sync_with_stdio(0);
}
vector<string> split(string str, char del) {
  vector<string> res;
  for (int i = 0, s = 0; i < SIZE(str); i++) {
    if (str[i] == del) {
      if (i - s != 0) res.push_back(str.substr(s, i - s));
      s = i + 1;
    } else if (i == SIZE(str) - 1) {
      res.push_back(str.substr(s));
    }
  }
  return res;
}
const string lgm = "BitLGM";
const string aryo = "BitAryo";
int N;
int as[3];
int dp[301][301];
int dfs(int a, int b) {
  if (dp[a][b] >= 0) return dp[a][b];
  if (a == 0 && b == 0) return 0;
  int res = 0;
  int c = min(a, b);
  for (int i = 1; i <= c; i++) {
    res |= !dfs(a - i, b - i);
  }
  for (int i = 1; i <= a; i++) {
    res |= !dfs(a - i, b);
  }
  for (int i = 1; i <= b; i++) {
    res |= !dfs(a, b - i);
  }
  return dp[a][b] = res;
}
int main() {
  cin >> N;
  for (int i = 0; i < N; i++) cin >> as[i];
  if (N == 1) {
    if (as[0] != 0)
      cout << lgm << endl;
    else
      cout << aryo << endl;
  } else if (N == 2) {
    memset(dp, -1, sizeof(dp));
    if (dfs(as[0], as[1]))
      cout << lgm << endl;
    else
      cout << aryo << endl;
  } else {
    int a = as[0] ^ as[1] ^ as[2];
    if (a)
      cout << lgm << endl;
    else
      cout << aryo << endl;
  }
  return 0;
}
