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

def judge():
    now = None
    for i in S:
        if now == i:
            print("Bad")
            return
        now = i
    print("Good")

judge()

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

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

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

Solution (Python):
S = input()

ans = "Good"

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

Solution (Python):


S = input()

a = S[:1]
b = S[1:2]
c = S[2:3]
d = S[3:4]

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

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

Solution (Python):
s = input()
b = ""

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

Solution (Python):
s = input()

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

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

Solution (Python):
s = list(map(int,input()))
output = 'Good'

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

print(output)

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

Solution (Python):
S = input()

flag = 0
temp = -1
for s in S:
    if s == temp:
        flag = 1
    temp = s
    
if flag == 1:
    print("Bad")
else:
    print("Good")

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

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

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

Solution (Python):
import sys

prev = None
for c in input().strip():
    if c == prev:
        print("Bad")
        sys.exit()
    prev = c
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()
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

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

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

Solution (Python):

def check(S):
    before = ''
    for c in S:
        if before == c:
            print('Bad')
            return
        before = c

    print("Good")
    return

if __name__ == "__main__":
    S = input()
    check(S)

Solution (Python):
def main():
  inp = input()
  before =None
  for a in inp:
    if before is None:
      before = a
      continue
    if before == a:
      print("Bad")
      return
    before = a
  print("Good")

main()

Solution (Python):
from collections import deque
from itertools import accumulate
import sys
sys.setrecursionlimit(10**6)
mo=10**9+7





s=input()
ans='Good'
pre=None
for i in s:
    if pre!=None:
        if pre==i:
            ans='Bad'
        pre=i
    else:
        pre=i
print(ans)

Solution (Python):
s = input()
temp = s[0]
ans = "Good"
for ss in s[1:]:
    if temp == ss:
        ans = "Bad"
        break
    else:
        temp = ss
print(ans)

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

Solution (Python):


num = int(input())


s = 10
f = 0
for i in range(4):
	t = num%10
	if s == t:
		f = 1
	s = t
	num = int(num/10)
if f ==1:
	print("Bad")
else:
	print("Good")

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

rtn = "Good"
u = -1
for i in range(4):
    t = s % 10
    if (t == u) :
        rtn = "Bad"
    u = t
    s //= 10

print(rtn)

Solution (Python):

import sys


def solve(S: str):
    prev = ''
    pres = ''

    for x in S:
        pres = x
        if pres == prev:
            print('Bad')
            return

        prev = pres

    print('Good')

    return


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


if __name__ == '__main__':
    main()

Solution (Python):
strings = list(input())
before_number = 100000
flag = False
for number in strings:
  
  if before_number == int(number):
    flag = True
  else:
    before_number = int(number)

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

Solution (Python):
s=input()
print('GBoaodd'[any(x==y for x, y in zip(s, s[1:]))::2])

Solution (Python):
S = int(input())
a = S // 1000
b = S // 100 - 10 * a
c = S // 10 - 100 * a - 10 * b
d = S - 1000 * a - 100 * b - 10 * c
if a == b or b == c or c == d:
    print("Bad")
else:
    print("Good")

Solution (Python):
def main():
    S = input()
    buf = ""
    for i in S:
        if i == buf:
            print("Bad")
            return 0
        buf = i
    print('Good')
    return 0

if __name__ == "__main__":
    main()

Solution (Python):
S = int(input())
a = S//1000
b = S//100 - a*10
c = S//10 - a*100 - b*10
d = S - a*1000 - b*100 - c*10
if a == b or b == c or c == d:
    print("Bad")
else:
    print("Good")

Solution (Python):
passcord = input()

tmp = ""
is_invalid = False
for i in range(len(passcord)):
    if tmp == passcord[i]:
        is_invalid = True
        break
    tmp = passcord[i]

if not is_invalid:
    print("Good")
else:
    print("Bad")

Solution (Python):
S = input()

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

Solution (Python):
N = input()
if N[0] == N[1] or N[1] == N[2] or N[2] == N[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):
target = input()

array = []
is_ok = True
for str in target:
    array.append(str)

for i in range(3):
    if array[i + 1] == array[i]:
        is_ok = False

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

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

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

Solution (Python):
s = str(input())
char_list = list(s)
hoge = ''
flg = True
for i in char_list:
    if hoge == i:
        print('Bad')
        flg = False
        break
    hoge = i
if flg:
    print('Good')

Solution (Python):
S=input()
c =''
f = 0
l = len(S)
for i in range(l):
    
    if S[i] ==c:
        f= 1
    c = S[i]
if f ==1:
    print('Bad')
else:
    print('Good')

Solution (Python):
s=str(input())
a=int(s[0])
b=int(s[1])
c=int(s[2])
d=int(s[3])
if a==b or b==c or c==d:
  print('Bad')
else:
  print('Good')

Solution (Python):


inp = input()
num = list(inp)

str_b = ""
f = False
for i in num:
  if i == str_b:
    f = True
    break
  str_b = i

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

Solution (Python):
S = input()
S_list = list(S)
ans = 0
for i in range(1,4):
  if S_list[i-1] == S_list[i]:
    ans += 1
  else:
    continue
if ans == 0:
  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()
a = 0
hantei = True

for i in list(S):
    if(a == i):
        hantei = False
    a = i

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

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

Solution (Python):
N = str(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()
current_char = ''
is_good = True
for char in list(S):
  if (char == current_char):
    is_good = False
  current_char = char
if is_good:
  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()
flag=False

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

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

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

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

Solution (Python):
s=input()
ans = 'Good'
last = s[0]
for i in s[1:]:
    if last==i:
        ans = 'Bad'
        break
    last = i
print(ans)

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

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




if __name__ == '__main__':
    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):
from sys import stdin
S = stdin.readline().rstrip()
memory = ''
for s in S:
    if memory == s:
        print('Bad')
        exit()
    memory = s
print('Good')

Solution (Python):
s=input()

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

Solution (Python):
S = input()

bad_flag = False
past_word = ''
for i in range(len(S)):
    if i != 0 and past_word == S[i]:
        bad_flag = True
    past_word = S[i]

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

Solution (Python):
import sys

input=sys.stdin.readline()
ans="Good"
for i in range(1,4):
    if input[i]==input[i-1]:
        ans="Bad"
print(ans)

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

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

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

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

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

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

print(ans)

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

Solution (Python):
S = input()

ans = 'Good'
prev = '
for s in S:
    if prev == s:
        ans = 'Bad'
        break
    prev = s
print(ans)

Solution (Python):
s = input()

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

print('Good')

Solution (Python):
S=list(input())
flag=0
b='a'
for s in S:
    if b==s:
        flag=1
    b=s
if flag==1:
    print("Bad")
else:
    print("Good")

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

def judge(s):        
    for i in range(len(s)-1):
        if s[i]==s[i+1]:
            return 'Bad'
        else:
            continue
    return 'Good'
print(judge(s))

Solution (Python):
s = input()
a = []
a = list(s)

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

Solution (Python):
a = input()

now = -1
for i in range(4):
    if now == a[i]:
        print("Bad")
        break
    if i == 3:
        if now == a[i]:
            print("Bad")
        else:
            print("Good")
    now = a[i]

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()
C = 0
for i in range(3):
	if S[i] == S[i+1]:
		C = 1

if C == 1:
	print('Bad')
else:
	print('Good')

Solution (Python):
s = input()
flg = False

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

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

Solution (Python):
s = input()

ans = s[0]
t = 'Good'
for i in s[1:]:
    if ans == i:
        t = 'Bad'
        break
    else:
        ans = i
print(t)

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

Solution (Python):
import sys

S = input()

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

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


str = input()

if __name__ == "__main__":
    main(str)

Solution (Python):
S=input()

kotae="Good"

if S[0]==S[1]:
  kotae="Bad"
if S[1]==S[2]:
  kotae="Bad"
if S[2]==S[3]:
  kotae="Bad"

print(kotae)

Solution (Python):
import re

def solve():
  S = input()
  for i in range(10):
    if re.search(str(i) + str(i), S):
      return 'Bad'
  return 'Good'

print(solve())

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

Solution (Python):







import sys
sys.setrecursionlimit(10**7)
from itertools import accumulate, combinations, permutations 
from math import factorial
def factorize(n):
    """return the factors of the Arg and count of each factor
    
    Args:
        n (long): number to be resolved into factors
    
    Returns:
        list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
    """
    fct = []  
    b, e = 2, 0  
    while b * b <= n:
        while n % b == 0:
            n = n // b
            e = e + 1
        if e > 0:
            fct.append((b, e))
        b, e = b + 1, 0
    if n > 1:
        fct.append((n, 1))
    return fct
def combinations_count(n, r):
    
    
    
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n
    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]
    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot
    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])
    return result
def combination_with_repetition_count(n, r):
    return combinations_count(n + r - 1, r)
from collections import deque, Counter 
from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
from copy import deepcopy, copy 
from operator import itemgetter 


from functools import reduce
from fractions import gcd 
def gcds(numbers):
    return reduce(gcd, numbers)
def lcm(x, y):
    return (x * y) // gcd(x, y)
def lcms(numbers):
    return reduce(lcm, numbers, 1)



INF = 10 ** 18
MOD = 10 ** 9 + 7
modpow = lambda a, n, p = MOD: pow(a, n, p) 
def modinv(a, p = MOD):
    
    
    return modpow(a, p-2, p)
def modinv_list(n, p = MOD):
    if n <= 1:
        return [0,1][:n+1]
    else:
        inv_t = [0,1]
        for i in range(2, n+1):
            inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
        return inv_t
def modfactorial_list(n, p = MOD):
    if n == 0:
        return [1]
    else:
        l = [0] * (n+1)
        tmp = 1
        for i in range(1, n+1):
            tmp = tmp * i % p
            l[i] = tmp
        return l
def modcomb(n, k, fac_list = [], p = MOD):
    
    
    from math import factorial
    if n < 0 or k < 0 or n < k: return 0
    if n == 0 or k == 0: return 1
    if len(fac_list) <= n:
        a = factorial(n) % p
        b = factorial(k) % p
        c = factorial(n-k) % p
    else:
        a = fac_list[n]
        b = fac_list[k]
        c = fac_list[n-k]
    return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
def modadd(a, b, p = MOD):
    return (a + b) % MOD
def modsub(a, b, p = MOD):
    return (a - b) % p
def modmul(a, b, p = MOD):
    return ((a % p) * (b % p)) % p
def moddiv(a, b, p = MOD):
    return modmul(a, modpow(b, p-2, p))




    
    

    
    
    
    
    

    
    





r = lambda: sys.stdin.readline().strip() 
R = lambda: list(map(int, r().split())) 
Rmap = lambda: map(int, r().split())


S = str(r())

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

Solution (Python):


s =  list(input())

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

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

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

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

Solution (Python):
def resolve():
    s = list(input())
    prev = '-1'
    for i in s:
        if i == prev:
            print("Bad")
            return
        prev = i
    print("Good")

resolve()

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

Thou=S//1000
tmp=S-Thou*1000
Hund=tmp//100
tmp=tmp-Hund*100
Ten=tmp//10
One=tmp%10

if Thou==Hund:
  print("Bad")
else:
  if Hund == Ten:
    print("Bad")
  else:
    if Ten==One:
      print("Bad")
    else:
      print("Good")

Solution (Python):
s = input()
x = s[0]
flag = True
for i in range(1, 4):
    if x == s[i]:
        flag = False
        break
    
    x = s[i]

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

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

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

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

Solution (Python):
s = input()

result = 'Good'
if s[0] == s[1]:
    result = 'Bad'
if s[1] == s[2]:
    result = 'Bad'
if s[2] == s[3]:
    result = 'Bad'

print(result)

Solution (Python):
S = int(input())
S1=S%10
S2=(S%100-S1)/10
S3=(S%1000-S2*10-S1)/100
S4=(S-S3*100-S2*10-S1)/1000

if S1==S2 or S2==S3 or S3==S4:
    print("Bad")
else:
    print("Good")

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

Solution (Python):
n = int(input())
now = n // 1000
n %= 1000
flag = 1
for i in range(3):
  if now == n // 10**(2-i) and flag == 1:
    print('Bad')
    flag = 0
  now = n // (10**(2-i))
  n %= 10**(2-i)
if flag == 1:
  print('Good')

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

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

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

print("Good")

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

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

Solution (Python):
import sys
S = input()

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

Solution (Python):
str=input()
n=len(str)

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

if flag==1:
    print('Good')

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

Solution (Python):
def main():
    S = [c for c in input()]
    ans = 'Good'
    pre = 'a'
    for c in S:
        if pre == c:
            ans = 'Bad'
            break
        pre = c
    print(ans)


main()

Solution (Python):
y=11
z=0

for x in input():
    if x==y:
        z=1
    y=x
        
if z==1:
    print("Bad")
else:
    print("Good")

Solution (Python):
s=int(input())
a=s//1000
b=s//100-a*10
c=s//10-b*10-a*100
d=s-c*10-b*100-a*1000
if a==b or b==c or c==d:
    print("Bad")
else:
    print("Good")

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

a = S % 10
b = int((S % 100) / 10)
c = int(S % 1000 / 100)
d = int(S / 1000)

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

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

Solution (Python):
S = list(input())
for i in range(len(S)-1):
    if S[i] == S[i+1]:
        ans = False
        break
    else:
        ans = True
print("Good") if ans 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):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

s = ns()
a = ''

for i in range(len(s)):
    if s[i] == a:
        print('Bad')
        exit()
    a = s[i]

print('Good')

Solution (Python):
s = input()
p = None
bad = False
for i in s:
  if i == p:
    print("Bad")
    bad = True
    break
  p = i
if not bad:
  print("Good")

Solution (Python):
S = input()

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

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

Solution (Python):

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

Solution (Python):
S = input()
n=0
b=0
while n<3 :
    if S[n]==S[n+1]:
        b=1
    n+=1
if b==1:
    print("Bad")
else:
    print("Good")

Solution (Python):
import sys

fin = sys.stdin.readline
num = str(fin()).split()[0]

readable = True
prev_num = num[0]
for i in range(1, 4):
    cur_num = num[i]
    if prev_num == cur_num:
        readable = False
    prev_num = cur_num

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

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


def inputs(): return [int(s) for s in input().split()]


def main():
    s = input()
    buf = '-1'
    for st in s:
        if buf == st:
            return 'Bad'
        buf = st
    return 'Good'


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

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

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

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

Solution (Python):
i = input()

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

Solution (Python):
a=input()
ans=0
for i in range(3):
    if a[i]==a[i+1]:
        ans=1
print("GBoaodd"[ans::2])

Solution (Python):
S=input()
flag=0
for i,s in enumerate(S):
    if i==0:
        pre=s
    if i!=0 and pre==s:
            flag=1
    
    pre=s
if flag==0:
    print("Good")
else:
    print("Bad")

Solution (Python):
from sys import exit, stdin
S = stdin.readline().rstrip()
for i, c in enumerate(S):
    if i == 0:
        continue
    if S[i] == S[i-1]:
        print('Bad')
        exit()
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] 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()

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

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

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

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

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

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

Solution (Python):
s = int(input())
sen = s//1000
hyaku = s//100 - sen*10
juu = s//10 - sen*100 - hyaku*10
iti = s - sen*1000 - hyaku*100 - juu*10

if (sen==hyaku)or(hyaku==juu)or(juu==iti):
    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

for i in range(len(S)-1):
    if S[i] == S[i+1]:
        flag = False
    else:
        pass

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

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

result = "Good"
for str in S:
    if M.count(str+str) > 0:
        result = "Bad"
        break
print(result)

Solution (Python):
s = input()
prev = 'x'
ans = None

for i in range(4):

    if prev == s[i]:
        ans = True
        break
    else:
        ans = False
    prev = s[i]

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

Solution (Python):
S = input()

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

Solution (Python):
a = input()
x = int(a)
b = "Good"
for i in range(len(a)-1):
    if a[i] == a[i+1]:
        b = 'Bad'
        break
    else:
        continue
print(b)

Solution (Python):
from sys import stdin

if __name__ == '__main__':
    s = stdin.readline().rstrip()
    flag = 1
    a = s[0]
    if s[0] == s[1]:
        flag = 0
    elif s[1] == s[2]:
        flag = 0
    elif s[2] == s[3]:
        flag = 0
    else:
        pass
    
    if flag == 1:
        print("Good")
    else:
        print("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()
i = 'a'
f = 0
for a in S:
  if i == a:
    f = 1
    break  
  i = a
if f == 1:
  print('Bad')
else:
  print('Good')

Solution (Python):
import sys
input1 = input()
l_input1 = list(input1)

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

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

Solution (Python):
import numpy as np

S = input()

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

Solution (Python):
S = input()
b = ''
for s in S:
    if s == b:
        print('Bad')
        exit()
    b = s
print('Good')

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

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

Solution (Python):
S = input()

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

print('Good')

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

a, b, c, d = S[0], S[1], S[2], S[3]

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

Solution (Python):
s = input()
x1 = s[:2]
x2 = s[1:3]
x3 = s[2:4]

if len(list(x1)) == len(set(x1)) and len(list(x2)) == len(set(x2)) and len(list(x3)) == len(set(x3)):
    print("Good")
else:
    print("Bad")

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

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

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

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

Solution (Python):
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def ii(): return stdin.readline()
num = ii()
def do():
    for i in range(1,4):
        if num[i] == num[i - 1]:
            return "Bad"
    else:
        return "Good"
print(do())

Solution (Python):
import fractions
import numpy as np
import os
import sys

s=input()

flag=True
for i in range(1,4):
    if(s[i-1]==s[i]):
        flag=False

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

Solution (Python):
N=list(input())
S=4
flag=0
for i in range(3):
    if N[i]==N[i+1]:
        flag=1
if flag==1:
    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()
r="Good"
for i in range(len(s)-1):
  if s[i]==s[i+1]:
    r="Bad"
    break
print(r)

Solution (Python):
S = input()

is_bad = False

for i in range(0, 10):
    if str(i)+str(i) in S:
        is_bad = True
        break

if is_bad:
    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())

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