#include <bits/stdc++.h>
using namespace std;
const int MAX = 1000000;
bool res[MAX];
int main()
{
int n;
cin >> n;
vector<pair<int, int> > A;
for(int i = 0; i < n; i++)
{
int x;
cin >> x;
A.push_back({x , i});
}
sort(A.begin(), A.end());
for(int i = 0; i < (int)A.size(); i++)
{
int val = A[i].first;
int mn = A[0].first;
int mx = A.back().first;
if (i ==0) mn = A[1].first;
if (i == (int)A.size() - 1)
mx = A[A.size() - 2].first;
int L = val - mn + 1;
int R = val + mn - 1;
L = max(L , mx - val + 1);
int pos = lower_bound(A.begin(), A.end(), make_pair(L, -1)) - A.begin();
if (pos == i) ++ pos;
if (pos == (int)A.size() || A[pos].first > R)
{
res[A[i].second] = 1;
}
}
for(int i = 0; i < n; i++)
{
if (res[i])
{
cout << "Good job, Kyrylo!" << endl;
}
else
{
cout << "Bon appetit, Dragon!" << endl;
}
}
return 0;
}
