#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pi acos(-1.0)
#define e exp(1.0)
const ll maxn=1e6+7;
ll N;
ll A[maxn];
int main()
{
// freopen(".../.txt","w",stdout);
ios::sync_with_stdio(false);
cin>>N;
ll i,j;
for(i=0;i<N;i++)
cin>>A[i];
ll x=0;
if(N&1)//奇数个,处理成偶数
A[N++]=0;
sort(A,A+N);
for(i=0;i+1<N;i+=2)
x^=(A[i+1]-A[i]);
if(x)
puts("Georgia will win");
else
puts("Bob will win");
return 0;
}