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()
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')
		break
else:
	print('Good')

Solution (Python):

def main():
    s = input()
    cnt = 0
    for i in range(1, len(s)):
        if s[i-1] == s[i]:
            cnt += 1
    if cnt >= 1:
        print('Bad')
    else:
        print('Good')


if __name__ == "__main__":
    main()

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

Solution (Python):
a = input()

flag = True

for i in range(len(a)-1):
    if a[i] == a[i+1]:
        flag = False
        break

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

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().split())
i = 0 + 2
while True:
    if s[i] == s[i + 1]:
        print_ans = 'Bad'
        break
    else:
        print_ans = 'Good'
    i += 1
    if i == 3 + 2:
        break
    
print(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(len(S)-1):
  if S[i] == S[i+1]:
    print("Bad")
    exit()
print("Good")

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

Solution (Python):
s=input()
f = 0
for i in range(3):
    if(s[i] == s[i+1]):
        f = 1
        break
if f == 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):
x = input()
ans = 'Good'
for i in range(3):
  if x[i]==x[i+1]:
    ans = 'Bad'
    break
print(ans)

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

Solution (Python):




s = input()
is_good = True
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        is_good = False
        break

print('Good') if is_good else print('Bad')

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

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

Solution (Python):
S = list(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 = list(input())
for i in range(1, 4):
    
    if s[i-1] == s[i]:
        print('Bad')
        exit()
print('Good')

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

Solution (Python):
s=input()
print("Bad" if any(s[i]==s[i+1] for i in range(3)) else "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 = 0
i = 0
while i < 3:
    if S[i] == S[i+1]:
        print("Bad")
        ans += 1
        break
    i += 1
        
if ans == 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):
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=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(0,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()
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):
a, b, c, d = list(input())
print('Bad' if a==b or b==c or c==d else 'Good')

Solution (Python):
s=input()
ans = "Good"
for i in range(1,len(s)):
	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()
flag = (s[0]==s[1])or(s[1]==s[2])or(s[2]==s[3])

print("Bad" if flag 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()

last = ""
for i in s:
    if (last == i):
        print("Bad")
        exit()
    last = i
print("Good")

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

Solution (Python):
result = 'Good'
S = list(input())
for i in range(len(S) - 1):
    if S[i] == S[i+1]:
        result = 'Bad'
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):
a=list(input())
count=0

       
for i in range(4):
  if i==3:
    break
  if a[i]==a[i+1] :
    count+=1
if count>=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):
import sys
from collections import defaultdict


def input():
    return sys.stdin.readline().rstrip()


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

    print("Good")


if __name__ == "__main__":
    main()

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
s = [int(n) for n in list(input())]

for i in range(3):
    if s[i] == s[i+1]:
        print('Bad')
        sys.exit(0)
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):
str = input()

flag = False
for i in range(len(str) - 1):
  if str[i] == str[i+1]:
    flag = True

print("Bad") if flag 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'
        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()
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")
        break
else:
    print("Good")

Solution (Python):
S=input().strip()
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()
p = 'a'
for s in S:
  if p == s:
    p = 'a'
    break
  else:
    p = s
print("Bad" if p == 'a' else "Good")

Solution (Python):
s=input();print(['Bad','Good'][all([s[i-1]!=s[i] for i in range(1,len(s))])])

Solution (Python):


def main():

    S = [int(x) for x in str(input())]

    ans = 'Good'

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

    print(ans)


if __name__ == "__main__":
    main()

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

Solution (Python):
v = list(map(int, input()))
for i in range(len(v) - 1):
    if v[i] == v[i+1]:
        print("Bad")
        quit()
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):




















































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    S = lines[0]
    
    
    
    
    
    
    
    
    
    

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

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['3776']
        lines_export = ['Bad']
    if pattern == 2:
        lines_input = ['8080']
        lines_export = ['Good']
    if pattern == 3:
        lines_input = ['1333']
        lines_export = ['Bad']
    if pattern == 4:
        lines_input = ['0024']
        lines_export = ['Bad']
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

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

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

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

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

if Sl[0] == Sl[1]:
  print('Bad')
elif Sl[1] == Sl[2]:
  print('Bad')
elif Sl[2] == Sl[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()
for i in range(1,len(S)):
  if S[i]==S[i-1]:
    print('Bad')
    exit()
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()
for i in range(3):
    if s[i]==s[i+1]:
        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):
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()

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

else:
    print('Good')

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

Solution (Python):


s = input()
before = '-'
for i in s:
    if i == before:
        print('Bad')
        exit(0)

    before = i

print('Good')

Solution (Python):
S = input()
flag = False
tmp = ''
for s in S:
  if tmp == s:
    flag = True
  tmp = s
if flag == True:
  print('Bad')
else:
  print('Good')

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

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

Solution (Python):
import sys
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()
print('Bad' if sum(s[i] == s[i + 1] for i in range(3)) else 'Good')

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

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

Solution (Python):
S = input()
flag = 0

for i in range(3):
    if S[i] == S[i+1]:
        flag += 1

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

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

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

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

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

Solution (Python):
s=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()
cnt = 1
maxcnt=1
for i in range(1,4):
  if s[i]==s[i-1]:
    cnt += 1
  else:
    maxcnt = max(cnt,maxcnt)
    cnt=1
maxcnt = max(cnt,maxcnt)
if maxcnt>=2:
  print("Bad")
else:
  print("Good")

Solution (Python):
import sys
arr = list(input())

before = arr[0]
for I in range(1,len(arr)):
    if before == arr[I]: print('Bad');sys.exit()
    before = arr[I]
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 = list(input())
t = s[0]
for i in range(1, 4):
    if t == s[i]:
        print('Bad')
        exit()
    t = s[i]

print('Good')

Solution (Python):
s = input()
l = len(s)
ans = 0

for i in range(l-1):
    if s[i] == s[i+1]:
        ans +=1

if ans == 0:
    print('Good')
if ans !=0:
    print('Bad')

Solution (Python):
pc = ""
for c in list(input()):
  if pc == c:
    print('Bad')
    exit()
  else:
    pc = c
print('Good')

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

Solution (Python):
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 1000000007
sys.setrecursionlimit(1000000)

S = rs()

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

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

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

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

if a==b or b==c or c==d:
  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 = 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()
f = 0
for i in range(len(S)-1):
  if S[i] == S[i+1]:
    f = 1
if f == 0:
  print('Good')
else:
  print('Bad')

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque, defaultdict


from collections import Counter

from itertools import accumulate,combinations,permutations,product

from heapq import heapify,heappop,heappush


from functools import reduce,lru_cache

from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    

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




if __name__ == "__main__":
    main()

Solution (Python):
s=list(str(input()))
f=True
for i in range(1,4):
	if s[i-1]==s[i]:
		f=False
		break
	else:
		continue
if f:
	print("Good")
else:
	print("Bad")

Solution (Python):
S = input()
flag = False
for s in S:
  if flag:
    if temp == s:
      print("Bad")
      quit()
  temp = s
  flag = True
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):
line = list(input())
if line[0] != line[1]:
    if line[1] != line[2]:
        if line[2] != line[3]:
            print("Good")
        else:
            print("Bad")
    else:
        print("Bad")
else:
    print("Bad")

Solution (Python):
l=list(input())
if l[0]==l[1] or l[1]==l[2] or l[2]==l[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 = 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()
lis = list(s)

if lis[0] == lis[1] or lis[1] == lis[2] or lis[2] == lis[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 = 1
for i in range(len(S)-1):
  if S[i] == S[i+1]:
    flag = 0
    break
if flag == 0:
  print('Bad')
else:
  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()
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 math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): 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)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0

S = X()

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

print("Good")

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

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

Solution (Python):
from itertools import groupby
import sys
rr = lambda: sys.stdin.readline().rstrip()

print('Good' if len(list(groupby(rr()))) == 4 else 'Bad')

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

Solution (Python):



s = input()
flag = True
prev = ''
for i in s:
	if i == prev:
		flag = False
		break
	prev= i
print("Good" if flag else "Bad")

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

Solution (Python):
x=input()
b=x[0]
for i in x[1:]:
  if b==i:
    print("Bad")
    break
  b=i
else:
  print("Good")

Solution (Python):
from itertools import groupby
import sys
rr = lambda: sys.stdin.readline().rstrip()
s = rr()
print('Good' if len(list(groupby(s))) == 4 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("Good" if S[0]!=S[1]!=S[2]!=S[3] else "Bad")

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):
def main():
    a=input()
    for i in range(1,len(a)):
        if(a[i]==a[i-1]):
            print("Bad")
            return;
    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):
import sys
input = lambda: sys.stdin.readline().rstrip()

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

Solution (Python):
s = list(input())
i = 0
answer = "Good"

while i < 3:
  if s[i] == s[i + 1]:
    answer = "Bad"
  i += 1
print(answer)

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 or b == c or c == d:
    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()
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 = 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(map(int, 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()

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

i = 0

if key[i] == key[i+1] or key[i+1] == key[i+2] or key[i+2] == key[i+3]:
  print('Bad')
else :
  print('Good')

Solution (Python):
s = input()

for i, j in zip(s, s[1:]):
  if i == j:
    print("Bad")
    break
else:
  print("Good")

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

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

if judge == "Bad":
    print("Bad")
else:
    print("Good")

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

Solution (Python):
s = input()
flg = True
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        flg = False
        break
print('Good') if flg 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()

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

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

if __name__ == "__main__":
    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(len(s) - 1):
    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 = input()
Flag = True
for T in range(0,3):
    if S[T]==S[T+1]:
        Flag = False
        break
if Flag:
    print('Good')
else:
    print('Bad')

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

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

Solution (Python):


s = input()
r = 'Bad'
if s[0] != s[1] and s[1] != s[2] and s[2] != s[3]:
  r = 'Good'
print(r)

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

Solution (Python):

s=input()
print('GBoaodd'[any(s[i-1]==s[i]for i in range(1,len(s)))::2])

Solution (Python):
S = input()

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

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

Solution (Python):
S = input()
  
i = 0
while i < len(S)-1:
  if S[i] == S[i+1]:
    print("Bad")
    break
  i += 1
else:
  print("Good")

Solution (Python):
print('Good'*eval('!='.join(input()))or'Bad')

Solution (Python):
print('Good'*eval('!='.join(input()))or'Bad')

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

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

ans=1

for i in range(3):
    if arr[i]==arr[i+1]:
        ans*=0
    
if ans==0:
    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):
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()
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()
before = s[0]
for i in range(1,len(s)):
  if before == s[i]:
    print('Bad')
    exit()
  before = s[i]
print('Good')

Solution (Python):
S = input()
prev = None
for s in S:
    if s == prev:
        print('Bad')
        break
    prev = s
else:
    print('Good')

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

Solution (Python):
s=list(input())
if s[0] != s[1] != s[2] != s[3]:
    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,t,u,v=input()
print('Bad' if s==t or t==u or u==v 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] 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("")
isgood = True
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
  isgood = False
if(isgood):
  print("Good")
else:
  print("Bad")

Solution (Python):
a,b,c,d = input()
print("Bad" if a==b or b==c or c==d 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):
S = list(input())
A = 0
for i in range(0, 3) :
  if S[i] == S[i + 1] :
    A = 1
  
if A == 0 :
  print("Good")
else :
  print("Bad")

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

Solution (Python):
inp = list(input())
hard = 0
for number in range(0, 3) :
  if inp[number] == inp[number + 1] :
    hard = 1
    
if hard == 0 :
  print("Good")
else :
  print("Bad")