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)):
	if i == len(S)-1:
		print("Good")
		break
	elif S[i] != S[i+1]:
		continue
	else:
		print("Bad")
		break

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] 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):
a,b,c,d = input()
print("Bad" if a==b or b==c or c==d else "Good")

Solution (Python):
n=str(input())
n=list(n)
if n[0]==n[1] or n[1]==n[2] or n[2]==n[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):
def ABC_131_A():
    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__':

    ABC_131_A()

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

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

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

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


solve()

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

Solution (Python):
import sys
S = list(input().rstrip())

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

print("Good")

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce


import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


s = S()
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 b==c:
    print("Bad")
elif c==d:
    print("Bad")
else:
    print("Good")

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

Solution (Python):
li = list(input())
ma = 0
tr = 0

for i,l in enumerate(li,1):
  if i==1:
    ma = l
  else:
    tr = l
    if ma==tr:
      print('Bad')
      break
    ma = l
  if i==4:
    print('Good')
    break

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(1,4):
  if S[i]==S[i-1]:
    print('Bad')
    exit(0)
print('Good')

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

Solution (Python):


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

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

Solution (Python):

import sys
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos, pi, e
from operator import itemgetter
sys.setrecursionlimit(10**6)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7

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

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

Solution (Python):
S = input()
for i in range(1,4):
  if S[i] == S[i-1]:
    print('Bad')
    break
else:
  print('Good')

Solution (Python):
S = list(input())
pr = 'X'
ans = 'Good'
for s in S:
    if pr == s:
        ans = 'Bad'
        break
    pr = s
print(ans)

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

Solution (Python):
S=raw_input()
prev=None
for x in S:
    if prev==x:
        print "Bad"
        quit()
    prev=x
else:
    print "Good"

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

p = ''
for i in s:
    if p == i:
        print('Bad')
        exit()
    else:
        p = i
print('Good')

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

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

Solution (Python):
s = input()
s_o = 10
flag = "ok"
for i in s:
    if s_o == i:
        flag = "ng"
    s_o = i
if flag == "ng":
    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):
a,b,c,d = input()

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

Solution (Python):
s=input();print("GBoaodd"[s[0]==s[1]or s[1]==s[2]or s[2]==s[3]::2])

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

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

Solution (Python):
S = list(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()

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

Solution (Python):


S = input()
S_set = set(S)

for i in S_set:
    j = i + i
    if j in S:
        print("Bad")
        exit()
print("Good")

Solution (Python):
S = input()

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

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):
password = input()
i = 0
answer = 'Good'
while i < 3:
    if password[i] == password[i+1]:
        answer = 'Bad'
        break
    else:
        i += 1
print(answer)

Solution (Python):
import numpy as np
import sys
import math

S=input()
s=S[0]
for i in range(len(S)-1):
    if S[i+1]==s:
        print('Bad')
        sys.exit()
    s=S[i+1]
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=str(input())
for i in range(1,len(S)):
    if S[i]==S[i-1]:
        ans ="Bad"
        break
    else:
        ans ="Good"
print(ans)

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

print('Good')

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

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

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


main()

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

Solution (Python):

tmp = ''
rt = 'Good'
for x in input():
    if x != tmp:
        tmp = x
    else:
        rt = 'Bad'
        break
print(rt)

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

Solution (Python):
from sys import exit
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[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=list(input())
for i in range(1,4):
    if s[i-1]==s[i]:
        print("Bad")
        break
else:
    print("Good")

Solution (Python):
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd 
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) 






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

Solution (Python):
s = input()
flag = True
for i in range(3):
    if s[i] == s[i+1]:
        flag = False
if flag:
    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):
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()

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

count=0
for i in range(-1,-4,-1):
  if N[i]==N[i-1]:
    count+=1
  else:
    count+=0
if count>=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()

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


import sys



















def main():
    mod = 1000000007                  
    inf = float('inf')
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    s = input()
    for i in range(1, len(s)):
        if s[i] == s[i-1]:
            print('Bad')
            exit()
    print('Good')

if __name__ == "__main__":
    main()

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

flag=0
for i in range(N-1):
    if S[i]==S[i+1]:
        flag=1

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

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

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

Solution (Python):
pre=""
for i in input():
    if i==pre:print("Bad");break
    pre=i
else:print("Good")

Solution (Python):
s = input()
count = 0
tmp = ''
for i in s:
  if tmp == '':
    tmp = i
  if tmp == i:
    count += 1
  else:
    tmp = i
if count >= 2:
  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[2] or s[2]==s[3] or s[1]==s[0]:
    print('Bad')
else:
    print('Good')

Solution (Python):

import sys
input = sys.stdin.readline









S = input().rstrip()

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

print(ans)

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()
ans = "Good" if s[0] != s[1] != s[2] != s[3] else "Bad"
print(ans)

Solution (Python):

s = input()
flg = False

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

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

Solution (Python):
S = input()

bool = True

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

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

Solution (Python):
def main():
    S = input()
    easy = True
    for i in range(len(S)-1):
        if S[i] == S[i+1]:
            easy = False
    if easy:
        print("Good")
    else:
        print("Bad")
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):
a, b, c, d=map(int,(input()))
l = [a, b, c, d]

if a==b or b==c or c==d:
    print("Bad")
else:
    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):
S=input()
if S[0]==S[1] or S[1]==S[2] or S[2]==S[3]:
  print('Bad')
else:
  print("Good")

Solution (Python):
Ss = input().rstrip()

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

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

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

if Sstr[0] == Sstr[1] or Sstr[1] == Sstr[2] or Sstr[2] == Sstr[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()

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

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

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

Solution (Python):
a,b,c,d = input()
print('Bad' if a==b or b==c or c==d 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()
if S[0] != S[1] and S[1] != S[2] and S[2] != S[3]:
    print("Good")
else:
    print("Bad")

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

""" Input
N, A, B = map(int, input().split())
A = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""

S = input().rstrip()
flag = False
for i in range(len(S) - 1):
    if S[i] == S[i+1]:
        flag = True

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

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

jadge = ""

for i in range(len(num) - 1):
  if num[i] != num[i + 1]:
    jadge = "Good"
    continue
  else:
    jadge = "Bad"
    break

print(jadge)

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

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()
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=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
if S[0] == S[1]:
    flag = False

elif S[1] == S[2]:
    flag = False

elif S[2] == S[3]:
    flag = False

if flag:
    print('Good')

else:
    print('Bad')

Solution (Python):
s=input()

cnt=0

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

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

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

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()
c = str(s)
p = 0
for i in c:
    if c[p] == c[p+1]:
        print('Bad')
        break
    if p == 2:
        print('Good')
        break
    p = p + 1

Solution (Python):

s = list(input())
f = True

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

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

Solution (Python):


code = list(input())

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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()
w = ''
ans = 'Good'

for a in S:
    if w == a:
        ans = 'Bad'
    w = a

print(ans)

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

Solution (Python):
S = input()
ans = "Good"
mae = "A"
for s in S:
    if s == mae:
        ans ="Bad"
    mae = s
    
print(ans)

Solution (Python):
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    S = iss()
    print('Good' if all([S[i] != S[i+1] for i in range(len(S)-1)]) else 'Bad')


if __name__ == '__main__':
    main()

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

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):
a,b, c,d= input()

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

Solution (Python):
a, b, c, d = input()
count = 0
if a == b or b == c or c == d:
  count += 1

if count == 1:
  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 = 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
s = list(input())
for i in range(len(s)-1):
    if s[i] == s[i + 1]:
        print('Bad')
        sys.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()
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('Good') if a[0]!=a[1] and a[1]!=a[2] and a[2]!=a[3] 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):
l = list(input())
for i in range(3):
  if l[i] == l[i+1]:
    print('Bad')
    exit()
print('Good')

Solution (Python):
S = input()

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

Solution (Python):
from sys import stdin
N= list(map(int,stdin.readline().strip()))
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')
    break
else:
  print('Good')

Solution (Python):
def pas():
    s = input()
    for i in range(len(s)-1):
        if s[i] == s[i+1] and i !=len(s)-1:
            return 'Bad'
    return 'Good'
print(pas())

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

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

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

Solution (Python):
S = input()
A = S[0]
B = S[1]
C = S[2]
D = S[3]

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

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

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

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

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

Solution (Python):
a = input()

print('Good' if a[0] != a[1] !=a[2] !=a[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()
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    print("Bad")
else:
    print("Good")

Solution (Python):
a = input()
flag = False

for i in range(0, 3):
    if a[i] == a[i+1]:
        print("Bad")
        flag = True
        break

if not flag:
    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 = 0
if S[0] == S[1]:
  ans = 1
if S[1] == S[2]:
  ans = 1
if S[2] == S[3]:
  ans = 1
if ans == 0:
  print('Good')
else:
  print('Bad')

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

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

Solution (Python):
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")

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



before = s[0]
isFlg = True

for i in s[1:]:
    if before == i:
        isFlg = False

    before = i

if isFlg == False:
    print("Bad")
else:
    print("Good")

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

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

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

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

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

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