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

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

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

Solution (Python):
from sys import exit



S = str(input())



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

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

Solution (Python):
S = input()

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

print(ans)

Solution (Python):
s=input()
p=s[0]
f=False
for i in range(3):
        if p==s[i+1]:
                f=True
        p=s[i+1]
print('Bad' if f 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):
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def YesNo(x): return 'Yes' if x else 'No'
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()

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

print(main())

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

Solution (Python):
import bisect
import heapq
import itertools
import math
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from fractions import gcd
from functools import lru_cache, reduce

import numpy as np

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

sys.setrecursionlimit(2147483647)
INF = float("inf")


S = sys.stdin.readline().rstrip()
c = list(S)
if c[0] == c[1] or c[1] == c[2] or c[2] == c[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()
for i in range(3):
  if s[i] == s[i+1]:
    print("Bad")
    exit(0)
print("Good")

Solution (Python):
a = input()

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

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

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

ans = "Good"

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

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

print('Good')

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007


def A():
    s = S()
    for i in range(len(s)-1):
        if s[i] == s[i+1]:
            print("Bad")
            quit()
    print("Good")
    return


def B():
    n = I()

    return


def C():
    n = I()

    return


def D():
    n = I()

    return


def E():
    n = I()

    return


def F():
    n = I()

    return


if __name__ == "__main__":
    A()

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



if __name__ == "__main__":
    main()

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

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

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

Solution (Python):

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

if __name__ == '__main__':
    main()

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()
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 any(t * 2 in n for t in '0123456789'):
    print ("Bad")
else:
    print ("Good")

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


rl = lambda: map(int,input().split())
rr = lambda N: [list(l) for l in zip(*[rl() for _ in range(N)])]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18
MOD = 10**9+7

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

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

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

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

Solution (Python):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, input().split()))
def inpl_str(): return list(input().split())

S = input()
bs = -1
for s in S:
    if s == bs:
        print('Bad')
        break
    bs = s
else:
    print('Good')