#!/usr/bin/env python3

import sys, math

input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')

sys.setrecursionlimit(10**8)

inf = float('inf')

ans=count=0



S=eval(input())

for i in range(3):

    if S[i]==S[i+1]:

        print("Bad")

        exit()

print("Good")

#!/usr/bin/env python3

import sys, math, itertools, heapq, collections, bisect

input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')

sys.setrecursionlimit(10**8)

inf = float('inf')

ans = count = 0



s=eval(input())

for i in range(3):

    if s[i]==s[i+1]:

        print("Bad")

        exit()

print("Good")
#!/usr/bin/env python3
import sys, math

input = lambda: sys.stdin.buffer.readline().rstrip().decode("utf-8")
sys.setrecursionlimit(10**8)
inf = float("inf")
ans = count = 0
S = eval(input())
for i in range(3):
    if S[i] == S[i + 1]:
        print("Bad")
        exit()
print("Good")

#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect

input = lambda: sys.stdin.buffer.readline().rstrip().decode("utf-8")
sys.setrecursionlimit(10**8)
inf = float("inf")
ans = count = 0
s = eval(input())
for i in range(3):
    if s[i] == s[i + 1]:
        print("Bad")
        exit()
print("Good")

-import sys, math +import sys, math, itertools, heapq, collections, bisect -S = eval(input()) +s = eval(input()) -    if S[i] == S[i + 1]: +    if s[i] == s[i + 1]: