#173.D

这是一个博弈题，自己还是不太会做，用DP，，好不容易才知道一点，

#include<cstdio>
#include<cstring>
#include<iostream>
#include<ctype.h>
#include<cstdlib>
#include<string>
using namespace std;

#define N 333
int dp[N][N]={0};
int a[4];
int n;

int make(int x,int y)
{
	if (dp[x][y])
		return dp[x][y];
	int i;
	for (i=1;i<=x;i++)
	{
		if (make(x-i,y)==2)
			return dp[x][y]=1;
	}

	for (i=1;i<=y;i++)
	{
		if (make(x,y-i)==2)
			return dp[x][y]=1;
	}

	for (i=1;i<=min(x,y);i++)
	{
		if (make(x-i,y-i)==2)
			return dp[x][y]=1;
	}

	return dp[x][y]=2;
}

int main()
{
	int i,j,k;
	cin>>n;
	i=0;
	while (i<n)
		cin>>a[i++];

	bool ok=false;
	if (n==1)
	{
		if (a[0])
			ok=true;
	}
	else if (n==3)
	{
		if (a[0]^a[1]^a[2])
			ok=true;
	}
	else
	{
		if (make(a[0],a[1])==1)
			ok=true;
	}
	if (ok)
		cout<<"BitLGM"<<endl;
	else
		cout<<"BitAryo"<<endl;

}

D. Yet Another Number Game

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Since most contestants do not read this part, I have to repeat that Bitlandians are quite weird. They have their own jobs, their own working method, their own lives, their own sausages and their own games!

Since you are so curious about Bitland, I'll give you the chance of peeking at one of these games.

BitLGM and BitAryo are playing yet another of their crazy-looking genius-needed Bitlandish games. They've got a sequence ofn non-negative integers a₁, a₂, ..., a_n. The players make moves in turns. BitLGM moves first. Each player can and must do one of the two following actions in his turn:

• Take one of the integers (we'll denote it as a_i). Choose integerx (1 ≤ x ≤ a_i). And then decreasea_i byx, that is, apply assignment: a_i = a_i - x.
• Choose integer x . And then decrease alla_i byx, that is, apply assignment: a_i = a_i - x, for alli.

The player who cannot make a move loses.

You're given the initial sequence a₁, a₂, ..., a_n. Determine who wins, if both players plays optimally well and if BitLGM and BitAryo start playing the described game in this sequence.

Input

The first line contains an integer n (1 ≤ n ≤ 3).

The next line contains n integers a₁, a₂, ..., a_n(0 ≤ a_i < 300).

Output

Write the name of the winner (provided that both players play optimally well). Either "BitLGM" or "BitAryo" (without the quotes).

Sample test(s)

Input

2
1 1

Output

BitLGM

Input

2
1 2

Output

BitAryo

Input

3
1 2 1

Output

BitLGM