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):
s = input()
for i in range(len(s) - 1):
    if s[i] == s[i+1]:
        print("Bad")
        exit()
print("Good")

Solution (Python):
S=input()
C=[]

for i in range(len(S)-1):
    C.append(int(S[i])-int(S[i+1]))
  
if C.count(0)==0:
    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):
password = input()
for i in range(3):
  if password[i] == password[i+1]:
    print('Bad')
    break
else:
  print('Good')

Solution (Python):
import sys
S = input()
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):
def main():
    word = input()

    flg = False
    kako = ""
    for w in word:
        if w == kako:
            flg = True
        kako = w

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


if __name__ == '__main__':
    main()

Solution (Python):
A=list(input())
n=0
for i in range(len(A)-1):
  if A[i]==A[i+1]:
    n=1
    break
print("Good"if n==0 else "Bad")

Solution (Python):
n = input()
for i in range(3):
    flag = False
    if n[i] == n[i+1]:
        flag = True
        break

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

Solution (Python):

code = input()

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

Solution (Python):

s = input()
ss = [si for si in s]

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())

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

Solution (Python):
S=str(input())
s1=S[0:1]
s2=S[1:2]
s3=S[2:3]
s4=S[3:4]
if s1==s2:
    print('Bad')
elif s2==s3:
    print('Bad')
elif s3==s4:
    print('Bad')
else:
    print('Good')

Solution (Python):
s = input()
t = 10
for i in s:
    if i == t:
        print('Bad')
        exit()
    else:
        t = i
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()

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

Solution (Python):
s = ''
for i in input():
    if s == i:
        print("Bad")
        exit()
    s = i
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()

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):
list1= input()

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

Solution (Python):

import sys


def solve(S: str):
    str_S = S
    for i in range(4):
        if i == 3:
            break
        if str_S[i] == str_S[i + 1]:
            print("Bad")
            return 
    print("Good")
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

Solution (Python):
S=list(input())
A=[]
for i in range ( len ( S ) - 1 ):
    A.append ( int( S[i+1] ) -int ( S[i] ) )

if 0 in A :
    print ( 'Bad' )
else :
    print ( 'Good' )

Solution (Python):
s = str(input())
number_list = []
count = 0
for number in s:
    number_list.append(number)
for i in range(3):
    if number_list[i] == number_list[i+1]:
        count += 1
    else:
        pass
if count == 0:
    print('Good')
else:
    print('Bad')

Solution (Python):

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

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

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()
for i in range(1, len(s)):
    if s[i] == s[i-1]:
        print("Bad")
        exit()
print("Good")

Solution (Python):
s = list(input())
tmp = s[0]
ans = 'Good'
for i in range(1, len(s)):
    if tmp == s[i]:
        ans = 'Bad'
        break
    else:
        tmp = s[i]
print(ans)

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

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

Solution (Python):



S = 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):
char_list = list(input())
for i in range(4):
    
    if i == 3:
        print('Good')
        break
    
    if char_list[i] == char_list[i+1] and i < 3:
        print('Bad')
        break

Solution (Python):
S=input()
a="Good"

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

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


if __name__ == '__main__':
    main()

Solution (Python):
S = input()

for i in range(len(S)-1):
    if S[i] == S[i+1]:
        print('Bad')
        break
    if i == len(S)-2:
        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):
word=input()
if word[0]==word[1] or word[1]==word[2] or word[2]==word[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=list(input())
if S[0]==S[1] or S[1]==S[2] or S[2]==S[3]:
	print("Bad")
else:
	print("Good")

Solution (Python):
l=[int(i) for i in input()]

ans='Good'
for i in range(3):
  if l[i]==l[i+1]:
    ans='Bad'
    break
    
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()


ans = 'Good'

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

print(ans)

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

    if s[0] == s[1]:
        print("Bad")
        return
    elif s[1] == s[2]:
        print("Bad")
        return
    elif s[2] == s[3]:
        print("Bad")
        return

    print("Good")


if __name__ == "__main__":
    test()

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

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

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

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

for i in range(3):
    if S[i] == S[i+1]:
        difficult = True
        break

if difficult:
    print('Bad')
else:
    print('Good')

Solution (Python):

N = str(input())

for i in range(len(N)-1):
    if N[i] == N[i+1]:
        print('Bad')
        exit()
    else:
        pass
print('Good')

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

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

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()
judge = 'Good'
for i in range(3):
	if S[i] == S[i+1]:
		judge = 'Bad'
print(judge)

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()

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

Solution (Python):
n=input()
a=0
for i in range(3):
    if n[i]==n[i+1]:
        a+=1
        break
if a==0:
    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):

input = input().split()
inputList = list(input[0])






flg = 1
for i in range(0, len(inputList)-1):
    if inputList[i] == inputList[i + 1]:
        flg = 0
        break

if flg == 0:
    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 = list(input())
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
c_b = 'a'
for c_n in input():
    if c_b == c_n:
        print("Bad")
        exit()
    c_b = c_n
print("Good")

Solution (Python):
S = input()
flag = 0
for i in range(3):
    if S[i] == S[i+1]:
        flag = 1
    else:
        continue

if flag == 1:
    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 = str(input())
if s[1] == s[2] or s[2] == s[3] or s[0] == s[1]:
    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[1]==s[0] 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(3):
  if s[i]==s[i+1]:
    flag=False
    break
print('Good' if flag else 'Bad')

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

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

Solution (Python):
S = input()
for i in range(len(S) - 1):
    if S[i] == S[i + 1]:
        print("Bad")
        break
else:
    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):
a = input()
 
if a[0]==a[1] or a[1]==a[2] or a[2]==a[3]:
  print('Bad') 
else:
  print('Good')

Solution (Python):
S=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):
def solve():
    s = input()
    return "Bad" if any([s[i] == s[i + 1] for i in range(len(s) - 1)]) else "Good"


if __name__ == "__main__":
    print(solve())

Solution (Python):
S=input()

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

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

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

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

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

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()
res = "Good"
for i in range(3):
  if s[i] == s[i+1]:
    res = "Bad"
print(res)

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()
print("Bad" if any([s[i]==s[i+1] for i in range(3)]) else "Good")

Solution (Python):
import sys

number=input()

for n in range(3):
    if number[n]==number[n+1]:
        print('Bad')
        sys.exit()
print('Good')

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

Solution (Python):

S = input()
S = [c for c in S]

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

Solution (Python):


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

if __name__ == '__main__':
    S = input()
    print(main(S))

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()
print(["Good", "Bad"][any(s[i] == s[i+1] for i in range(3))])

Solution (Python):
s = input()
print(["Good", "Bad"][any(len(set(s[i:i+2])) == 1 for i in range(3))])

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

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

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

if cnt > 0:
    print('Bad')
else:
    print('Good')

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

Solution (Python):
s = input()

for i in range(1,len(s)):
  if s[i-1] == s[i]:
    print('Bad')
    quit()
  else:
    pass

print('Good')

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

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(int(i) for i in input())
for i in range(len(S)-1):
  if S[i]==S[i+1]:
    print('Bad')
    break
else:
  print('Good')

Solution (Python):
s = list(map(int, list(input())))
for i in range(len(s) - 1):
    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()

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

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(len(S)-1):
    if S[i] == S[i+1]:
        print('Bad')
        exit()

print('Good')

Solution (Python):
S = input()
before = ''
for x in S:
    if before == x:
        print('Bad')
        exit()
    before = x

print('Good')

Solution (Python):


import os
import sys

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):
N = input()
tmp = ""
for i in N:
  if tmp == i:
    print("Bad")
    exit()
  tmp = i

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()

hantei="Good"

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

Solution (Python):
s = input()
if len(set(s)) == 4:
    print('Good')
elif len(set(s)) == 1:
    print('Bad')
elif len(set(s)) == 2:
    if s[0] == s[2] and s.count(s[0]) == 2:
        print('Good')
    else:
        print('Bad')
else:
    if s[0] == s[1] or s[1] == s[2] or s[2] ==s[3]:
        print('Bad')
    else:
        print('Good')

Solution (Python):
s = input()
prev = ''
for c in s:
    if c == prev:
        print('Bad')
        exit()
    else:
        prev = c
print('Good')

Solution (Python):
s=list(raw_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())
for i in range(len(s)):
  s[i]=int(s[i])
  
j=(s[1]-s[0])*(s[2]-s[1])*(s[3]-s[2])

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

Solution (Python):
import sys
A = [i for i in input()]
for j in range(len(A)-1):
  if A[j] == A[j+1]:
    print("Bad")
    exit()
  else:
    None
print("Good")

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

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

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

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

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

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

jud = "Good"
for i in range(3):
    if s[i] == s[i+1]:
        jud = "Bad"
        break

print(jud)

Solution (Python):
def iread():
    return int(input())


def sread():
    return input()


def aread_int():
    tmp = input().split()
    ret = [int(i) for i in tmp]
    return ret


def aread_str():
    return input().split()


if __name__ == '__main__':
    s = sread()
    for i in range(10):
        if str(i) * 2 in s:
            print("Bad")
            exit()

    print("Good")

Solution (Python):
S = list(map(int, input().rstrip()))
for i in range(3):
  if S[i]==S[i+1]:
    print("Bad")
    exit()
print("Good")

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

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

Solution (Python):

import sys


def solve(S: str):
    for i in range(len(S)-1):
        if S[i+1] == S[i]:
            print('Bad')
            return
    print('Good')
    return 


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = str(next(tokens))  
    solve(S)

if __name__ == '__main__':
    main()

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

Solution (Python):
import sys

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

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

Solution (Python):
a = input()
no = 0

for i in range(3):
    if(a[i] == a[i+1]):
        no = 1

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

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

Solution (Python):
a = input()

str_list = list(a)



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

Solution (Python):
print((lambda x:sum([i==j for i,j in zip(x[1:],x[:3])])and'Bad'or'Good')(input()))

Solution (Python):

code = input()
for i in range(1, len(code)):
    if code[i] == code[i-1]:
        print('Bad')
        break
else:
    print("Good")

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

Solution (Python):
S=input()
n=[int(S[i]) for i in range(4)]

judge=True
for i in range(3):
  if n[i]==n[i+1]:
    judge=False
    
if judge:
  print('Good')
else:
  print('Bad')

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

Solution (Python):
S = input()
is_bad = False
ex = None
for s in S:
  if s == ex:
    is_bad = True
    break
  ex = s
if is_bad:
  print('Bad')
else:
  print('Good')

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

Solution (Python):
s = input().split()[0]

is_difficult = False

for i in range(0, len(s)-1):
    if s[i] == s[i+1]:
        is_difficult = True
        break

ans = 'Bad' if is_difficult else 'Good'
print(ans)

Solution (Python):

s = input()

def solve(s):
    if len(s) <= 1:
        return False
    if s[0] == s[1]:
        return True
    return solve(s[1:])

print("Bad" if solve(s) else "Good")

Solution (Python):
num = input()
l = [i for i in num]
count = 0
for k in range(0,len(l)-1):
    if l[k] == l[k+1]:
        count+=1
if count > 0:
    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 int(s[0])==int(s[1]) or int(s[1])==int(s[2]) or int(s[2])==int(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=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()

for i in range(1, len(n)):
    if n[i-1] == n[i]:
        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()
b = 0

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())
l = len(S)
B = True
for i in range(l - 1):
    if S[i] == S[i + 1]:
        B = False
        break
if B:
    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 "Good")

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

if flg ==0:
    print("Good")
else:
    print("Bad")

Solution (Python):
S = input().strip()
ans = "Good"
for i in range(1, len(S)):
    if S[i] == S[i-1]:
        ans = "Bad"
print(ans)

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()

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

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

Solution (Python):
w=input();print("BGaodo d"[w[0]!=w[1]!=w[2]!=w[3]::2])

Solution (Python):
w=input()

cnt=0
for i in w:
    if cnt+1 < len(w):
        if w[cnt] == w[cnt+1]:
            print("Bad")
            exit()
    cnt += 1

print("Good")

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

main()

Solution (Python):
S=list(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()
if s[0] != s[1] and s[1] != s[2] and s[2] != s[3]:
    print('Good')
else:
    print('Bad')

Solution (Python):
w=input();print("GBoaodd"[1^(w[0]!=w[1]!=w[2]!=w[3])::2])

Solution (Python):
def main():
    S = input()

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


if __name__ == "__main__":
    main()

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

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

result = "Good"
for i in range(3):
    if N[i] == N[i+1]:
        result = "Bad"

print(result)

Solution (Python):
str = input()
p = ""
result = "Good"
for s in str:
    if p == s :
        result = "Bad"
    p = s
print(result)

Solution (Python):
S=input()[:4]

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

Solution (Python):
S = input()
A = S + "a"
for i in range(4):
    if A[i] == A[i+1]:
        print('Bad')
        break
    
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()

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

Solution (Python):
import sys
input = sys.stdin.readline

def main():
	s = input().strip()
	for i in range(len(s)-1):
		if s[i] == s[i+1]:
			print('Bad')
			return
	print('Good')

if __name__ == '__main__':
	main()

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

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

Solution (Python):
l = list(input())
p = [int(i) for i in l]
err = 0

for i in range(len(p)-1):
     if p[i] == p [i+1]:
         err = 1
         break
if err == 0:
    print("Good")
else:
    print("Bad")

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

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

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

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

flag = True
for i in range(3):
    if  s[i] == s[i+1]:
        flag = False
        break
if flag:
    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=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 = list(map(int, input()))
ans = 'Good'
for i in range(3):
    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()
c=0
for i in range(0,3):
	if(s[i]==s[i+1]):
		print("Bad")
		c=1
		break
if(c==0):
	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):
word = list(input())
bomb = 0
for w in range(1, len(word)):
  if word[w] == word[w - 1]:
    bomb += 1
    break
if bomb == 0:
  print("Good")
else:
  print("Bad")

Solution (Python):
from copy import *
from sys import *
import math
import queue
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)


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

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(m,n):
	x = max(m,n)
	y = min(m,n)
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	return y

class queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

Solution (Python):
S = input()
for i in range(3):
    if S[i] == S[i+1]:
        print('Bad')
        exit()
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()
for i in range(len(S)-1):
    if S[i] == S[i + 1]:
        print("Bad")
        exit()
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()

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

Solution (Python):

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

Solution (Python):

def main():
    s = input()
    flg = all(i != j for i, j in zip(s, s[1:]))
    print("Good" if flg else "Bad")


if __name__ == "__main__":
    main()

Solution (Python):

def main():
    s = input()
    if all(i != j for i, j in zip(s, s[1:])):
        print("Good")
    else:
        print("Bad")


if __name__ == "__main__":
    main()

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

Solution (Python):
line = list(input())
j = 0
for l in range(0, len(line) - 1):
  if line[l] == line[l + 1]:
    j += 1
if j == 0:
  print('Good')
else:
  print('Bad')

Solution (Python):
S = int(input())
a = int(S / 1000)
b = int(S % 1000 / 100)
c = int(S % 100 / 10)
d = int(S % 10)
if (a == b) or (b == c) or (c == 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):
a = input()
for i in range(1, len(a)):
    if a[i] == a[i-1]:
        print("Bad")
        exit()
print("Good")

Solution (Python):
S = input()

flg = 0
temp = 0

for i in range(len(S)-1):
    if S[i] == S[i+1]:
        print("Bad")
        flg = 1
        break

if flg == 0:
    print("Good")

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