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

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

Solution (Python):
nb = [int(x) for x in input()]
def solo(nb):
  for loop in range(3):
    if nb[loop] == nb[loop+1]:
      return ("Bad")
  return "Good"
print(solo(nb))

Solution (Python):
s,c,sa=input(),0,False
while c<len(s):
  if c>0 and s[c-1]==s[c]:
    sa=True
  c+=1
print("Bad" if sa else "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):
a, b, c, d = input()
print("Good" if a != b != c != d else "Bad")

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

Solution (Python):
s=int(input())
m=10
ans=0
for i in range(0,4):
  n=s%10
  if m==n:
    print("Bad")
    ans+=1
    break;
  m=n
  s//=10
if ans==0:
  print("Good")

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

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

Solution (Python):
def split(word): 
    return [char for char in word]  
inp=input()
list=split(inp)
count=0
x=1
str="Good"
for i in range(3):
    if list[count]==list[count+1]:
        str="Bad"
    count=count+1
print(str)

Solution (Python):


s = input()
cnd = True

for i in range(0, len(s)-1):
    
    if int(s[i]) == int(s[i+1]):
        cnd = False
        break

if cnd == True:
    print("Good")
else:
    print("Bad")

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()
i=[]
i.extend(S)
if i[0]==i[1]:
        print('Bad')
elif i[1]==i[2]:
        print('Bad')
elif i[2]==i[3]:
        print('Bad')
else:
    print('Good')

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    S = readline().strip()
    
    bad = False
    for i in range(3):
        if S[i] == S[i+1]:
            bad = True
            break
            
    if bad:
        print('Bad')
    else:
        print('Good')
    
    return


if __name__ == '__main__':
    main()

Solution (Python):
flg = True
S = input()

for i in range(1, 4):
    if S[i] == S[i - 1]:
        flg = False

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

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('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:i+2].count(S[i]) == 2:
        print('Bad')
        break
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):
import sys
a=sys.stdin.readline()
b=list(a)
A,B,C,D = [int(b[i]) for i in (0,1,2,3)]
if A==B or B==C or C==D:
    print("Bad")
else:
    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:
  print("Bad")
else:
  print("Good")

Solution (Python):
import sys
sys.setrecursionlimit(10**6)

s = input()

ch_prev = ''
for ch in s:
    if ch_prev and ch == ch_prev:
        print('Bad')
        break
    else:
        ch_prev = ch
else:
    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')


if __name__ == '__main__':
    solve()

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

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=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(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):
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):
x = input()
z = 1
y = x[0]
for i in x[1:]:
      if (y == i):
            print("Bad")
            z = 0
            break
      y = i
if (z!= 0):
      print("Good")

Solution (Python):
def solve():
	s = input()
	if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
		return "Bad"
	return "Good"
		
		
if __name__ == "__main__":
	print(solve())

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):
pwd = input()
before = ""
for s in pwd:
    if before == s:
        print("Bad")
        break
    before = s
else:
    print("Good")

Solution (Python):
a = input()
ans = []
for i in range(1,len(a)):
  if a[i-1] == a[i]:
    ans.append(False)
  else:
    ans.append(True)
if False in ans:
  print('Bad')
else:
  print('Good')

Solution (Python):
a, b, c, d = input()
if a!=b!=c!=d:
    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()
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()
t = s[0]
for i in range(1, len(s)):
    if s[i] == t:
        print('Bad')
        exit()
    t = s[i]
print('Good')

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

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

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

Solution (Python):
s = input()

pre = ""
for x in s:
    if(x==pre):
        print('Bad')
        exit()
    pre = x
print('Good')

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

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

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

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

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

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

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

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

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

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("Good" if a!=b and b!=c and c!=d else "Bad")

Solution (Python):
A,B,C,D=input()
if A!=B!=C!=D:
  print("Good")
else:
  print("Bad")

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

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys

input = lambda: sys.stdin.readline().rstrip()


def solve():

    S = input()

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

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

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

if __name__ == '__main__':
    main()

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

Solution (Python):
def main():
    s = input()
    before = ''
    for v in s:
        if before == v:
            print('Bad')
            exit()
        before = v
    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 = list(input())
ans = 1
for i in range(4-1):
    if s[i] == s[i+1]:
        ans = 0
print(["Bad","Good"][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 = raw_input()
def f(s):
	for u,v in zip(s,s[1:]):
		if u == v:return 'Bad'
	return 'Good'
print f(s)

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

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

Solution (Python):
import math
def ip():return int(input())
def inp():return map(int,input().split())
def linp():return list(map(int,input().split()))

n=int(input())
g=n%10
s=n//10%10
b=n//100%10
q=n//1000%10
if g==s or s==b or b==q:print("Bad")
else:print("Good")

Solution (Python):
import math
def ip():return int(input())
def inp():return map(int,input().split())
def linp():return list(map(int,input().split()))

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

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    s = list(input()[:-1].decode())
    if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
        print('Bad')
    else:
        print('Good')


if __name__ == "__main__":
    setrecursionlimit(10000)
    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 = list(input())

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

Solution (Python):
s = input()

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

Solution (Python):
def main():
    S = input()
    t = 'a'
    for c in S:
        if t == c:
            return False
        t = c
    return True
if main():
    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()
t = [i for i in s]

for i in range(3):
  if t[i] == t[i+1]:
    ck = False
    break
else:
  ck = True

print('Good' if ck 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()
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()

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

import sys
input = sys.stdin.readline
S =input().strip()
for i in range(len(S)-1):
    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):
a,b,c,d = input()

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

Solution (Python):
S = list(input())
for i in range(0,3,1):
  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()

def is_good(code):
  if code[0] == code[1] or code[1] == code[2] or code[2] == code[3]:
    return False
  return True

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

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

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

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

Solution (Python):
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")

INF = float("inf")











n = int(input())
a = n % 10
n //= 10
b = n % 10
n //= 10
c = n % 10
n //= 10
d = n % 10
if a == b or b == c or c == d:
    print("Bad")
else:
    print("Good")

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

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

Solution (Python):
password = input()
x = list(password)
if int(x[0])-int(x[1]) == 0 \
    or int(x[1])-int(x[2]) == 0 \
    or int(x[2])-int(x[3]) == 0 :
    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()
for i in range(3):
    if s[i] == s[i+1]:
        print("Bad")
        s = 0
        break
if s != 0:
    print("Good")

Solution (Python):
def main():
  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")
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()
ans = 'Good'

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

print(ans)

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

for c in s:
    if pre == c:
        print('Bad')
        exit()
    pre = c

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()
print('Good' if all(si != sj for si, sj in zip(s, s[1:])) else 'Bad')

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

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()
s_prev = ""
for s_i in s:
    if s_i == s_prev:
        print('Bad')
        exit()
    s_prev = s_i
print('Good')

Solution (Python):
s = input()

for i in range(0,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, b, c, d = input()
print('Good' if a != b != c != d else 'Bad')

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

Solution (Python):



def main():
    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')


if __name__ == '__main__':
    main()

Solution (Python):
S = input()

pre = ""
for s in S:
    if pre == s:
        print("Bad")
        exit()
    pre = s

print("Good")

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

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

if s[0]==s[1] or s[1]==s[2] or s[3]==s[2]:
    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 = input()

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

print("Good")

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

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

Solution (Python):
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):
n = input()
if n[0]==n[1] or n[1]==n[2] or n[2]==n[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")
        exit()
print("Good")

Solution (Python):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from fractions import gcd
from math import ceil, floor, sqrt
from copy import deepcopy

def main():
   s = input()
   flag = True
   for i,v in enumerate(s):
      if i != 0:
         if s[i-1] == v:
            flag = False
            break
   if flag:
      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):
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 = input()
flg = "Good"
for i in range(4-1):
    if s[i]==s[i+1]:
        flg = "Bad"
print(flg)

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

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

Solution (Python):
s=input()

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

Solution (Python):
s = input()

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

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

Solution (Python):
a,b,c,d=input();print(' GBoaodd'[a!=b!=c!=d::2])

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()
n = ""
for i in s:
    if n == i:
        print("Bad")
        exit(0)
    n = i
print("Good")

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

Solution (Python):
S = input()

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

Solution (Python):
s=list(input())
before=0
flag=1
for i in s:
    if i==before:
        flag-=1
    else:
        before=i
if flag<1:
    print("Bad")
else:
    print("Good")

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

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

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

Solution (Python):

S = input()

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

if fl is True:
    print("Good")

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

Solution (Python):
import itertools


def resolve():
    S = input()
    group = itertools.groupby(S)

    if len(S) != len(list(group)):
        print('Bad')
        return

    print('Good')


resolve()

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

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

Solution (Python):
from collections import Counter 
from collections import defaultdict
from collections import deque
import math
import itertools
import heapq
import numpy as np
import sys
sys.setrecursionlimit(10**6)




input_list = lambda : list(map(int,input().split()))


s=input()

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

print("Good")

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
s = S()
ans = 'Good'
tmp = ''
for c in s:
    if tmp == c:
        ans = 'Bad'
    tmp = c
print(ans)

Solution (Python):
import itertools
import math
import fractions
import functools
import copy

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

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

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

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

print("Good")

Solution (Python):
s=input()
a=99
ans=True
for i in range(len(s)):
    if s[i]==a:
        ans=False
        break
    a=s[i]
    
if ans==True:
    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()
for num in range(0,3):
    if s[num] == s[num +1]:
        print("Bad")
        break
    elif num == 2:
        print("Good")

Solution (Python):

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

    return "Good" if s[0] != s[1] and s[1] != s[2] and s[2] != s[3] else "Bad"
def main():
    s = list(str(input()))
    print(security(s))

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

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

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

Solution (Python):
import sys
import math
import bisect

def main():
    s = input()
    ans = True
    for i in range(1, len(s)):
        if s[i] == s[i-1]:
            ans = False
    if ans:
        print('Good')
    else:
        print('Bad')
    
if __name__ == "__main__":
    main()

Solution (Python):
S = input()

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

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 = 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")
    quit()
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()
print("Good" if S[0] != S[1] != 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()
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 = 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=str(input())
print("Good" if all([n[i]!=n[i+1] for i in range(3)]) else "Bad")