Problem:
 Score : 100 points    Problem Statement  The door of Snuke's laboratory is locked with a security code.  The security code is a 4 -digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.  You are given the current security code S . If S is hard to enter, print Bad ; otherwise, print Good .      Constraints   S is a 4 -character string consisting of digits.         Input  Input is given from Standard Input in the following format:  S       Output  If S is hard to enter, print Bad ; otherwise, print Good .        Sample Input 1 3776      Sample Output 1 Bad  The second and third digits are the same, so 3776 is hard to enter.       Sample Input 2 8080      Sample Output 2 Good  There are no two consecutive digits that are the same, so 8080 is not hard to enter.       Sample Input 3 1333      Sample Output 3 Bad       Sample Input 4 0024      Sample Output 4 Bad

Solution (Python):
num=input()
c=False
for i in range(1,len(num)):
  if num[i]==num[i-1]:
    c=True
    
if c==True:
  print("Bad")
else:
  print("Good")

Solution (Python):
a = input()
if a.count("00") > 0:
    print("Bad")
elif a.count("11") > 0:
    print("Bad")
elif a.count("22") > 0:
    print("Bad")
elif a.count("33") > 0:
    print("Bad")
elif a.count("44") > 0:
    print("Bad")
elif a.count("55") > 0:
    print("Bad")
elif a.count("66") > 0:
    print("Bad")
elif a.count("77") > 0:
    print("Bad")
elif a.count("88") > 0:
    print("Bad")
elif a.count("99") > 0:
    print("Bad")
else:
    print("Good")

Solution (Python):
a,b,c,d=input()
print("Bad" if a==b or b==c or c==d else "Good")

Solution (Python):
s = list(input())
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
s=input()

if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
  print("Bad")
else:
  print("Good")

Solution (Python):
s = input()
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
s = input()
for i in range(3):
    if s[i] == s[i+1]:
        print('Bad')
        exit()
print('Good')

Solution (Python):
S=input()
if S[0]!=S[1] and S[1]!=S[2] and S[2]!=S[3]:
  print("Good")
else:
  print("Bad")

Solution (Python):
s=input()
ans="Good"
for i in range(3):
    if s[i]==s[i+1]:
        ans="Bad"
print(ans)

Solution (Python):
S=input()
for i in range(len(S)-1):
    if S[i] == S[i+1]:
        print("Bad")
        exit()
print("Good")

Solution (Python):
S = input()
print('Bad' if S[0] == S[1] or S[1] == S[2] or S[2] == S[3] else 'Good')

Solution (Python):
S = input()
res = False

for i in range(len(S) - 1):
    if S[i] == S[i + 1]:
        res = True

print(['Good', 'Bad'][res])

Solution (Python):
a,b,c,d= list(input())

if a==b:
    print('Bad')
elif b==c:
    print('Bad')
elif c==d:
    print('Bad')
else:
    print('Good')

Solution (Python):
S = input()
ans = "Good"
for i in range(3):
  if S[i] == S[i+1]:
    ans = "Bad"
    break
print(ans)

Solution (Python):
n = input()
for i in range(len(n)-1):
  if n[i] == n[i+1]:
    print('Bad')
    exit()
print('Good')

Solution (Python):

S = str(input())

if S[0]==S[1] or S[1]==S[2] or S[2]== S[3]:
    print('Bad')
    
else:
    print('Good')

Solution (Python):
s=input()
print('Bad' if s[0]==s[1] or s[1]==s[2] or s[2]==s[3] else 'Good')

Solution (Python):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 6)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
al = "abcdefghijklmnopqrstuvwxyz"
AL = al.upper()

s = v()
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        print("Bad")
        sys.exit()

print("Good")

Solution (Python):
s = input()
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):



S = input()
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
S = input()

if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
'''
問題：
    すぬけ君の管理する研究室の扉にはロックがかかっており、解錠にはセキュリティコードを入力する必要があります。

    セキュリティコードは 4 桁の数字列です。
    セキュリティコードが「入力しづらい」とは、同じ数字が連続する箇所が存在することを言います。

    現在のセキュリティコード S が与えられます。
    S が「入力しづらい」なら Bad を、そうでなければ Good を出力してください。
'''

'''
制約：
    S は半角数字のみからなる長さ 4 の文字列
'''

def abc131a(s: str) -> str:
    if s[0] == s[1]:
        return 'Bad'
    elif s[1] == s[2]:
        return 'Bad'
    elif s[2] == s[3]:
        return 'Bad'
    else:
        return 'Good'

s = str(input())
print(abc131a(s))

Solution (Python):
s = input()
tmp1 = s[0]
for i in range(1, len(s)):
    tmp2 = s[i]
    if tmp1 == tmp2:
        print('Bad')
        exit()
    else:
        tmp1 = tmp2
print('Good')

Solution (Python):
s = input()

ans = 'Good'
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        ans = 'Bad'
        break
print(ans)

Solution (Python):
s=input()
a=0
for i in range(len(s)-1):
  if s[i]==s[i+1]:
    print('Bad')
    a=1
    break
if a==0:
    print('Good')

Solution (Python):
def atc_131a(input_value: str) -> str:
    for i in range(0, len(input_value) - 1):
        if input_value[i] == input_value[i + 1]:
            return "Bad"
    return "Good"

input_value = input()
print(atc_131a(input_value))

Solution (Python):
s = input()
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        print('Bad')
        exit()

print('Good')

Solution (Python):


S = str(input())
if S[0]!=S[1] and S[1]!=S[2] and S[2]!=S[3]:
    print("Good")
else:
    print("Bad")

Solution (Python):
s = input()
print("Bad") if s[0] == s[1] or s[1] == s[2] or s[2] == s[3] else print("Good")

Solution (Python):
S = input()
pre = '_'
flg = True
for s in S:
  flg = flg and (s != pre)
  pre = s
print('Good' if flg else 'Bad')

Solution (Python):


def main():
    a, b, c, d = input()
    print("Bad" if a == b or b == c or c == d else "Good")


if __name__ == "__main__":
    main()

Solution (Python):
s = str(input())



if s[0] == s[1]:
    print('Bad')
elif s[1] == s[2]:
    print('Bad')
elif s[2] == s[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
s = input()
for i, j in zip(s[0:],s[1:]):
    if i == j:
        print('Bad')
        break
else:
    print('Good')

Solution (Python):
S = input()

if(S[0] == S[1] or S[1] == S[2] or S[2] == S[3]):
    print("Bad")
else:
    print("Good")

Solution (Python):
s = input()
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
S = input()
pre = '_'
flg = True
for s in S:
  flg = flg and (s!=pre)
  pre = s
print('Good' if flg else 'Bad')

Solution (Python):
s = input('')
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
s = input()

print('Bad' if s[0] == s[1] or s[1] == s[2] or s[2] == s[3] else 'Good')

Solution (Python):
s = input('')


if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
s = input()
if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
  print("Bad") 
else:
  print("Good")

Solution (Python):
s=input()

flag=True
for i in range(len(s)-1):
    if s[i+1]==s[i]:
        flag=False
print("Good" if flag else "Bad")

Solution (Python):
s = input()
print("Bad" if s[0] == s[1] or s[1] == s[2] or s[2] == s[3] else "Good")

Solution (Python):
moji = str(input())
flg = 0
for i in range(0,3):
    if moji[i] == moji[i+1]:
        flg = 1

print(("Good","Bad")[flg == 1])

Solution (Python):
s = input()
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
	print("Bad")
else:
	print("Good")

Solution (Python):
S = input()
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
s = input()
print('Bad' if s[0] == s[1] or s[1] == s[2] or s[2] == s[3] else 'Good')

Solution (Python):
S = str(input())

if S[0]==S[1] or S[1]==S[2] or S[2]==S[3]:
  print("Bad")
else:
  print("Good")

Solution (Python):


S = list(input())


if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
s  = input()
ans = 'Good'
for i in range(3):
    if s[i] == s[i+1]:
        ans = 'Bad'
print(ans)

Solution (Python):
S = list(map(int,input()))

if S[0] == S[1] or S[1] == S[2]or S[2] == S[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
s = input()
if (s[0] == s[1] or s[1] == s[2] or s[2] == s[3]):
  print("Bad")
else:
  print("Good")

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    S = SS()

    ans = 'Good'
    for i in range(len(S) - 1):
        if S[i] == S[i+1]:
            ans = 'Bad'
            break

    print(ans)

if __name__ == '__main__':
    resolve()

Solution (Python):
S = input()

D =[]
for i in range(3):
    if S[i] == S[i+1]:
        D.append(1)
        break


if 1 in D:
    print("Bad")

else:
    print("Good")

Solution (Python):
S = input()
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print('Bad')

else:
    print('Good')

Solution (Python):
S = input()
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print('Bad')

else:
    print('Good')

Solution (Python):
S = input()

ans = "Good"
for i in range(len(S) - 1):
    if S[i] == S[i + 1]:
        ans = "Bad"

print(ans)

Solution (Python):

S = input()
Pass = list(S)

if Pass[0]==Pass[1]:
    print("Bad")
elif Pass[1]==Pass[2]:
    print("Bad")
elif Pass[2]==Pass[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
s = input()
if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
	print("Bad")
else:
	print("Good")

Solution (Python):
lis = ["00","11","22","33","44","55","66","77","88","99"]
s = input()
ans = True
for i in lis:
  if i in s:
    ans = False
if ans:
  print("Good")
else:
  print("Bad")

Solution (Python):
S = input()

if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
S = list(input())

ans = 'Good'
for i in range(len(S) - 1):
    if S[i] == S[i+1]:
        ans = 'Bad'

print(ans)

Solution (Python):
s=input()

if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
    print("Bad")
else:print("Good")

Solution (Python):
s = input()

for i in range(1,4):
  if s[i] == s[i-1]:
    print("Bad")
    exit()
print("Good")

Solution (Python):
s = input()
s = s + "*"
ans = "Good"
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        ans = "Bad"
        break
print(ans)

Solution (Python):
S=input()
for i in range(0,3):
    if S[i]==S[i+1]:
        print("Bad")
        break
else:
    print("Good")

Solution (Python):
s = list(input())

if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
S = input()

if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]: print('Bad')
else: print('Good')

Solution (Python):
S = input()

if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
S = input()
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
  print("Bad")
else:
  print("Good")

Solution (Python):
n = input()
print('Bad' if n[0]==n[1] or n[1]==n[2] or n[2]==n[3] else 'Good')

Solution (Python):
S=list(input())

if S[0]==S[1] or S[1]==S[2] or S[2]==S[3] :
    print('Bad')
else:
    print('Good')

Solution (Python):
S = input()

code_list = []
for code in S:
    code_list.append(code)

answer = code_list[0] != code_list[1] != code_list[2] != code_list[3]

if answer:
    print( "Good" )
else:
    print( "Bad" )

Solution (Python):
s = input()

for i in range(len(s) - 1):
    if s[i] == s[i + 1]:
        print("Bad")
        exit()

print("Good")

Solution (Python):
n = list(input())

if n[0] == n[1]:
  print("Bad")
  exit()
elif n[1] == n[2]:
  print("Bad")
  exit()
elif n[2] == n[3]:
  print("Bad")
  exit()
print('Good')

Solution (Python):
s = list(input())

if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
N=list(input())
if N[0]==N[1] or N[1]==N[2] or N[2]==N[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
s = input()
for i in range(3):
    if s[i] == s[i+1]:
        print('Bad')
        exit()
print('Good')

Solution (Python):
S = input()

res = ''
for s in S:
    if res == s:
        print('Bad')
        exit()
    res = s
print('Good')

Solution (Python):



s = input()

result = 'Good'
i = 0
j = 1
while j < len(s):
    if s[i] == s[j]:
        result = 'Bad'
        break

    i += 1
    j += 1

print(result)

Solution (Python):
s = input()

if  s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
S = input()
print("Good" if S[0] != S[1] != S[2] != S[3] else "Bad")

Solution (Python):
S = input()
for i in range(3):
    if S[i] == S[i + 1]:
        print('Bad')
        quit()
print('Good')

Solution (Python):
S = input()
if S[0] != S[1] and S[1] != S[2] and S[2] != S[3]:
    print("Good")
else:
    print("Bad")

Solution (Python):
s = list(input())
flag = 0
for i in range(len(s) - 1):
    if s[i] == s[i+1]:
        flag = 1

print('Bad' if flag == 1 else 'Good')

Solution (Python):
S = str(input())

if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
s=input()
if s[0]!=s[1] and s[1]!=s[2] and s[2]!=s[3]:
  print("Good")
else:
  print("Bad")

Solution (Python):
s = str(input())
isBad = False
for i in range(3):
    if s[i]==s[i+1]:
        isBad = True
if isBad:
    print('Bad')
else:
    print('Good')

Solution (Python):
def atc_131a(input_value: str) -> str:
    for i in range(0, len(input_value) - 1):
        if input_value[i] == input_value[i + 1]:
            return "Bad"
    return "Good"

input_value = input()
print(atc_131a(input_value))

Solution (Python):
S = str(input())
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
s = int(input())
a = [0]*4
a[0] = s//1000 
s = s-a[0]*1000
a[1] = s//100
s = s-a[1]*100
a[2] = s//10
s = s-a[2]*10
a[3] = s
if(a[0]==a[1] or a[1]==a[2] or a[2]==a[3]):
  print("Bad")
else:
  print("Good")

Solution (Python):
s = input()
for i in range(3):
    if s[i] == s[i+1]:
        print('Bad');exit()
print('Good')

Solution (Python):
s = input()
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
S = input()

if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
S = input()

if S[0] == S[1] or S[1] == S[2] or S[2]==S[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
a,b,c,d = input()
print('Good' if a != b and b != c and c != d else 'Bad')

Solution (Python):
A=input()
for i in range(3):
   if A[i]==A[i+1]:
      print("Bad")
      exit()
print("Good")

Solution (Python):
no=input()
l=len(no)
flag=0
for i in range(l-1):
    if no[i]==no[i+1]:
        print("Bad")
        exit()
print("Good")

Solution (Python):
s=input()

for i in range(3):
  if s[i] == s[i+1]:
    print("Bad")
    exit()
else:
  print("Good")

Solution (Python):
numbers = input()
i = 0
while i <= 2:
    if numbers[i] == numbers[i + 1]:
        print("Bad")
        exit()
    else:
        i += 1

print("Good")

Solution (Python):
numbers = input()
i = 0
x = 1
while i <= 2:
    if numbers[i] == numbers[x]:
        print("Bad")
        exit()
    else:
        i += 1
        x += 1

print("Good")

Solution (Python):

S = str(input())

if S[0] == S[1]:
    result = "Bad"
elif S[1] == S[2]:
    result = "Bad"
elif S[2] == S[3]:
    result = "Bad"
else:
    result = "Good"

print(result)

Solution (Python):



S = input()
x = 99
j = 0

for i in S:
    if x == i:
        j += 1
    else:
        x = i

if j == 0:
    print('Good')
else:
    print('Bad')

Solution (Python):
a=input()
z=0
for i in range(3):
  if a[i]==a[i+1]:
    z=1
print("Bad" if z else "Good")

Solution (Python):
s = input()

if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
s = input()
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        print('Bad')
        exit()
print('Good')

Solution (Python):
S = str(input())





if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
a = input()

def func():
    for x in range(len(a) - 1):
        if a[x] == a[x + 1]:
            return 'Bad'

    return 'Good'

print(func())

Solution (Python):
number = input()
check = False
for i in range(len(number)-1):
    if number[i] == number[i+1]:
        check = True
if check == True:
    print("Bad")
else:
    print("Good")

Solution (Python):
S=list(str(input()))
for i in range(1,4):
    if S[i-1]==S[i]:
        print('Bad') 
        exit()

print('Good')

Solution (Python):
num = input()
t = 0
for i in range(len(num)-1):
    if num[i] == num[i+1]:
        t = 1
if t == 1:
    print('Bad')
else:
    print('Good')

Solution (Python):
S = input()

result = "Good"
for i in range(1, len(S)):
    if S[i] == S[i-1]:
        result = "Bad"
        break
print(result)

Solution (Python):
s=input()
for i in range(1,4):
    if s[i-1]==s[i]:
        print("Bad")
        exit()
print("Good")

Solution (Python):
a, b, c, d = map(int, input())

if a == b or b == c or c == d:
    print("Bad")
else:
    print("Good")

Solution (Python):

S = str(input())


c_list = list(S)
cnt = 1
judge = "Good"
for cnt in range(1,4,1):
    if c_list[cnt-1] == c_list[cnt]:
        judge = "Bad"


print(judge)

Solution (Python):
arr = list(input())
for k in range(len(arr) - 1):
  if arr[k] == arr[k+1]:
    print("Bad")
    exit()
print("Good")

Solution (Python):
N = input()
for i in range(10):
    if N.count(str(i)*3)or N.count(str(i)*2)or N.count(str(i)*4):
        print('Bad')
        exit()
print('Good')

Solution (Python):

S = str(input())


if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    result = "Bad"
else:
    result = "Good"


print(result)

Solution (Python):
S = input()

for i in range(0, len(S) - 1, ):
    if S[i] == S[i + 1]:
        print('Bad')
        exit()

print('Good')

Solution (Python):
S = input()

if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
S = str(input())

if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
S = input()
ans = 'Good'

for i in range(3):
    if S[i] == S[i + 1]:
        ans = 'Bad'
        break

print(ans)

Solution (Python):
S = str(input())
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
S = str(input())
if S[0] == S[1] == S[2] == S[3] or S[0] == S[1] == S[2] or S[1] == S[2] == S[3] or S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
S=input()
judge=0
for i in range(0,3):
    if S[i]==S[i+1]:
        judge+=1
if judge>=1:
    print("Bad")
else:
    print("Good")

Solution (Python):
S = input()
for i in range(3):
  if S[i] == S[i + 1]:
    print("Bad")
    break
else:
  print("Good")

Solution (Python):
s=input()

if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
    print("Bad")
    
else:
    print("Good")

Solution (Python):
S = input()

if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
S=input()
pre = S[0]
for s in S[1:]:
  if pre == s:
    print("Bad"); exit()
   
  pre = s
  
print("Good")

Solution (Python):
s = input()
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
S = input()
i_list = list(S)
i_list = [int(i) for i in i_list]

if i_list[0] == i_list[1] or i_list[1] == i_list[2] or i_list[2] == i_list[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
S = input()
for i in range(9):
    hikaku = str(i)+str(i)
    
    if (hikaku in S) == True:
        result = "Bad"
        break
    else:
        result = "Good"
print(result)

Solution (Python):
initial_input_num_of_str = input()
double_eyes_list = ['00']


first_numbers = initial_input_num_of_str[0:2]
center_numbers = initial_input_num_of_str[1:3]
last_numbers = initial_input_num_of_str[-2:]

for i in range(11, 100, 11):
    double_eyes_list.append(str(i))

if first_numbers in double_eyes_list:
    print('Bad')
elif center_numbers in double_eyes_list:
    print('Bad')
elif last_numbers in double_eyes_list:
    print('Bad')
else:
    print('Good')

Solution (Python):
s = input()
if s[0]==s[1] or s[1]==s[2] or s[2]==s[3] :
  print('Bad')
else :
  print('Good')

Solution (Python):
s = input()
print('Bad' if s[0]==s[1] or s[1]==s[2] or s[2]==s[3] else 'Good')

Solution (Python):
S = input()
for i in range(3):
    if S[i] == S[i+1]:
        print('Bad')
        exit()
print('Good')

Solution (Python):
S = input()
for i in range(3):
    if S[i] == S[i+1]:
        print('Bad')
        exit()
print('Good')

Solution (Python):
a,b,c,d = list(input())

if a==b or b==c or c==d:
    print('Bad')
else:print('Good')

Solution (Python):
s=input()
print(["Good","Bad"][s[0]==s[1] or s[1]==s[2] or s[2]==s[3]])

Solution (Python):
s = input()

for i in range(3):
    if s[i] == s[i+1]:
        print('Bad')
        exit()

print('Good')

Solution (Python):
list01 = list(input())
if list01[0] == list01[1] or list01[1] == list01[2] or list01[2] == list01[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
S = input()
 
answer = "Good"
prev_s = S[0]
for s in S[1:]:
  if prev_s == s:
    answer = "Bad"
    break
  prev_s = s
 
print(answer)

Solution (Python):
s = input()
for i in range(len(s) - 1):
  if s[i] == s[i + 1]:
    print('Bad')
    exit()
print('Good')

Solution (Python):
S=input()
for i in range(len(S)-1):
    if S[i]==S[i+1]:
        print('Bad')
        exit()
print('Good')

Solution (Python):


S  = input()
sl = len(S)
for i in range(sl-1):
    if S[i] == S[i+1]:
        print('Bad')
        exit()
print('Good')

Solution (Python):
s = input()
for i in range(len(s) - 1):
    if s[i] == s[i+1]:
        print("Bad")
        exit()
print("Good")

Solution (Python):
s = input()
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]: print('Bad')
else: print('Good')

Solution (Python):
S = input()
for i in range(len(S)-1):
  if S[i] == S[i+1]:
    print("Bad")
    quit()
print("Good")

Solution (Python):
s = input()
 
for i in range(3):
    if s[i] == s[i+1]:
        print('Bad')
        exit()
print('Good')

Solution (Python):
a=input()
if(a[0]==a[1]):
    print("Bad")
elif(a[1]==a[2]):
    print("Bad")
elif(a[2]==a[3]):
    print("Bad")
else:
    print("Good")

Solution (Python):
s=input()
ans='Good'
for i in range(3):
  if s[i]==s[i+1]:
    ans='Bad'
print(ans)

Solution (Python):
s = input()

ans = 'Good'

for i in range(3):
   if s[i] == s[i+1]:
         ans = 'Bad'
         break

print(ans)

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

S = input()
for i in range(3):
    if S[i]==S[i+1]:
        print('Bad')
        break
else:
    print('Good')

Solution (Python):
S = input()

cnt = 0
for i in range(1, len(S)):
    if S[i] == S[i-1]:
        cnt += 1

print('Bad' if cnt >= 1 else 'Good')

Solution (Python):
passward = input()
ok = True
for i in range(1, len(passward)):
  if passward[i] == passward[i - 1]:
    ok = False
    break

if ok:
  print("Good")
else:
  print("Bad")

Solution (Python):
def main():
    s = input()
    for i in range(3):
        if s[i] == s[i+1]:
            print("Bad")
            exit()
    print("Good")


main()

Solution (Python):
s=str(input())
if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
  print("Bad")
else:
  print("Good")

Solution (Python):
N = input()

print("Good" if (N[0] != N[1]) and (N[1] != N[2]) and (N[2] != N[3]) else "Bad")

Solution (Python):
s=input()
n=len(s)
f=0
for i in range(n-1):
    if(s[i]==s[i+1]):
        f=1
        break

if(f==1):
    print("Bad")
else:
    print("Good")

Solution (Python):
s=str(input())
d=True
for i in range(3):
  if s[i+1]==s[i]:
    d=False
    
if d:
  print("Good")
else:
  print("Bad")

Solution (Python):
def main():
    import sys
    sys.setrecursionlimit(10**7)
    input = sys.stdin.readline

    s = input().strip()

    if s[0] == s[1]:
        print('Bad')
        exit()

    if s[1] == s[2]:
        print('Bad')
        exit()

    if s[2] == s[3]:
        print('Bad')
        exit()

    print('Good')


main()

Solution (Python):
s = input()
ans = "Good"

if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    ans = "Bad"

print(ans)

Solution (Python):
S = input()
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
  print("Bad")
else:
  print("Good")

Solution (Python):
S=input()
print("Good" if S[0]!=S[1]!=S[2]!=S[3] else "Bad")

Solution (Python):
def main():
    S = input()
    ans = "Good"

    for i in range(3):
        if S[i] == S[i + 1]:
            ans = "Bad"
            break

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
x=list(map(int,input()))
if x[0]==x[1] or x[1]==x[2] or x[2]==x[3]:
  print("Bad")
else:
  print("Good")

Solution (Python):
s=input()
for i,j in zip(s[0:],s[1:]):
  if i==j:
    print("Bad")
    exit()
print("Good")

Solution (Python):
s = str(input())
ans = "Good"
for i in range(10):
  k = str(i)+str(i)
  if(k in s):
    ans = "Bad"
    break
print(ans)

Solution (Python):
S = input()
is_good = True
for i in range(1, len(S)):
    if S[i] == S[i - 1]:
        is_good = False
if is_good:
    print("Good")
else:
    print("Bad")

Solution (Python):
s = input()

flg = True
for a, b in zip(s, s[1:]):
    if a == b:
        flg = False
print("Good" if flg else"Bad")

Solution (Python):
S = input()
if S[0] != S[1]!= S[2] != S[3]:
  print("Good")
else:
  print("Bad")

Solution (Python):
a=input()
if a[0]==a[1]:
  print("Bad")
else:
  if a[1]==a[2]:
    print("Bad")
  else:
    if a[2]==a[3]:
      print("Bad")
    else:
      print("Good")

Solution (Python):
a,b,c,d = input()

print("Bad" if a==b or b==c or c==d else "Good")

Solution (Python):
S = input()

check = True
for i in range(3):
  if S[i] == S[i+1]:
    check = False
    
if check:
  print("Good")
else:
  print("Bad")

Solution (Python):
i=list(input())
if(i[0]==i[1] or i[1]==i[2] or i[2]==i[3]):
    print("Bad")
else:
    print("Good")

Solution (Python):
x = input()
ans = 'Good'
for i in range(len(x)-1):
  if x[i]==x[i+1]:
    ans = 'Bad'
    break
print(ans)

Solution (Python):
S = input()
for i in range(len(S)-1):
  if S[i] == S[i+1]:
    print("Bad")
    exit()
print("Good")

Solution (Python):
S = list(input())
for i in range(1,4):
  if S[i] == S[i-1]:
    print("Bad")
    exit()
print("Good")

Solution (Python):
S=input()
for i in range(len(S)-1):
  if S[i]==S[i+1]:
    print('Bad')
    exit()
print('Good')

Solution (Python):
s = input()
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print('Bad')
else:
    print('Good')

Solution (Python):
s=input()
c=0
for i in range(3):
  if s[i]==s[i+1]:
    c+=1
if c==0:
  print("Good")
else:
  print("Bad")

Solution (Python):
a = input()
print("Bad" if a[0]==a[1] or a[1]==a[2] or a[2]==a[3] else "Good")

Solution (Python):
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy


import heapq
sys.setrecursionlimit(10**6)

INF = 10**18
import bisect
import statistics
mod = 10**9+7


S = input()

for i in range(1,len(S)):
     if S[i] == S[i-1]:
        print("Bad")
        sys.exit()

print("Good")

Solution (Python):
s = input()
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
a = input()
print("Bad" if a[0] == a[1] or a[1] == a[2] or a[2] == a[3] else "Good")

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

s = input()
for i in range(len(s) - 1):
    if s[i] == s[i+1]:
        print('Bad')
        quit()
print('Good')

Solution (Python):
a,b,c,d = str(input())
if a==b or b==c or c==d:
  print('Bad')
else:
  print('Good')

Solution (Python):
lst = input().split()
if lst[0][0]==lst[0][1] or lst[0][1]==lst[0][2] or lst[0][2]==lst[0][3]:
  print('Bad')
else:
  print('Good')

Solution (Python):
x = input ()
a = 'Good'
for i in range (3):
  if x[i] == x[i+1]:
    a = 'Bad'
    break
print (a)

Solution (Python):











S = input()
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

s=input()
for i in range(3):
    if s[i]==s[i+1]:
        print("Bad")
        exit()
print("Good")

Solution (Python):
s = input()
for i in range(1,4):
    if s[i] == s[i-1]:
        print('Bad')
        exit(0)
print('Good')

Solution (Python):
from sys import stdin, stdout
from time import perf_counter

import sys
sys.setrecursionlimit(10**9)
mod = 10**9+7




s = input()

print("Bad" if s[0]==s[1] or s[1]==s[2] or s[2]==s[3] else "Good")

Solution (Python):
s=input()

if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
  print('Bad')
else:
  print('Good')

Solution (Python):
s=list(input())
import sys
for i in range(1,4):
  if s[i]==s[i-1]:
    print("Bad")
    sys.exit()
    
print("Good")

Solution (Python):

s = input()
for i in range(1, len(s)):
    if s[i] == s[i - 1]:
        print('Bad')
        exit()
print('Good')

Solution (Python):
S = input()

ans = 0
for i in range(1,len(S)):
    if S[i] == S[i-1]:
        ans += 1

if ans >= 1:
    print("Bad")
else:
    print("Good")

Solution (Python):
s=input()
for i in range(len(s)-1):
    if s[i]==s[i+1]:
        print("Bad")
        exit()
print("Good")

Solution (Python):
s = input()
print("Good" if s[0] != s[1] and s[1] != s[2] and s[2] != s[3] else "Bad")

Solution (Python):
s = input()

for i in range(3):
  if s[i] == s[i + 1]:
    print('Bad')
    exit()

print('Good')

Solution (Python):
S = input()
for i in range(3):
    if S[i] == S[i+1]:
        print('Bad')
        exit()
print('Good')

Solution (Python):
a = list(input())

l = []
for i in zip(a, a[1:]):
    l.append(i)

if any([l[i][0] == l[i][1] for i in range(3)]):
    print('Bad')
else:
    print('Good')

Solution (Python):
s = input()
for i in range(3):
  if s[i] == s[i + 1]:
    print("Bad")
    break
else:
  print("Good")