from bisect import bisect_left
n = int(input())
a = list(map(int, input().split()))
a = sorted([[a[i], i] for i in range(n)])
res = [False for _ in range(n)]
for i in range(n):
val = a[i][0]
mn = a[0][0]
mx = a[-1][0]
if i == 0:
mn = a[1][0]
if i == n - 1:
mx = a[-2][0]
l = max(val - mn, mx - val) + 1
r = val + mn - 1
pos = bisect_left(a, [l, -1])
if pos == i:
pos += 1
if pos == n or a[pos][0] > r:
res[a[i][1]] = True
for i in range(n):
print("Good job, Kyrylo!" if res[i] else "Bon appetit, Dragon!")
