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):
abcd = int(input())
d = int(abcd % 10)
c = int(((abcd - d) % 100)/10)
b = int((abcd - c*10 - d)%1000/100)
a = int(abcd / 1000)

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

Solution (Python):
S = input()
S = [int(i) for i in S]

delta1 = S[1]-S[0]
delta2 = S[2]-S[1]
delta3 = S[3]-S[2]
  
if delta1 * delta2 * delta3 == 0:
	print('Bad')
else:
	print('Good')

Solution (Python):
input_number = int(input())
 
a = input_number//1000
b = (input_number-1000*a)//100
c = (input_number-1000*a-100*b)//10
d = input_number-1000*a-100*b-c*10
if a==b:
	print('Bad')
elif b==c:
	print('Bad')
elif c==d:
	print('Bad')
else:
    print('Good')

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

Solution (Python):
a=int(input())
b=a%10
c=(a-b)/10
judg="Good"
for i in range(3):
    if b==c%10:
        judg="Bad"
    else:
        b=c%10
        c=(c-b)/10
print(judg)

Solution (Python):
code     = list(input())
bad_flag = False

for i in range(0, 3):
    if code[i] == code[i+1]:
        bad_flag = True
        break

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

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

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

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):
import sys
S = input()
for x, y in zip(S,S[1:]):
    if x == y:
        print('Bad')
        sys.exit()
print('Good')

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

word=""
flag="Good"
for w in password:
  
  if word==w:
    flag="Bad"
  
  word=w
print(flag)

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

print(ans)

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

Solution (Python):
s = input()
for v1, v2 in zip(s[1:], s[:-1]):
    if v1 == v2:
        print("Bad")
        break
else:
    print("Good")

Solution (Python):
s=input()

isok=True

for k in range(len(s)-1):
    if s[k]==s[k+1]:
        isok=False

if isok:
    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();
good = 1;
for i in range(3) :
	if s[i] == s[i+1] :
		good = 0;
if bool(good) :
	print('Good');
else :
	print('Bad')

Solution (Python):
s=input()
import re
p = '00'
for i in range(1, 11):
  if p in s:
      print('Bad')
      break
  p = str(i * 11)
else:
    print('Good')

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

Solution (Python):
code = input()

prev = ''
for i in range(0, len(code)):
    if code[i] == prev:
        print("Bad")
        exit(0)
    else:
        prev = code[i]

print("Good")

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 = list(input())
s_list = []
index = 0
result = "Good"
for x in S:
  if index == 0:
    s_list.append(x)
    index+=1
  else:
    if s_list[index-1] == S[index]:
      result = "Bad"
    else:
      s_list.append(x)
      index+=1
print(result)

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


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

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

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

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

Solution (Python):
S = input()
print('GBoaodd'[any(S[i]==S[i+1] for i in range(3))::2])

Solution (Python):
S = str(input())
a = int(S[0])
b = int(S[1])
c = int(S[2])
d = int(S[3])

def afunc(a,b,c,d):
  alist = [a,b,c,d]
  pre = a
  for char in alist[1:4]:
    if pre == char:
      print("Bad")
      return
    else:
      pre = char
  print("Good")

afunc(a,b,c,d)

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

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

Solution (Python):
S = input()

tmp = ""
is_bad = False
for s in S:
    if s == tmp:
        is_bad = True
    tmp = s

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

Solution (Python):



def checkSuccessionNum(strNum):
    beforChar = strNum[0]
    
    for c in inputNum[1:]:
        if(beforChar == c):
            return True
        else:
            beforChar = c
            
    return False

inputNum = input()

if(checkSuccessionNum(inputNum)):
    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")
        quit()
print("Good")

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

tmp = ""
for i in range(len(S)):
    if tmp == S[i]:
        print("Bad")
        sys.exit()
    else:
        tmp = S[i]

print("Good")

Solution (Python):
S = raw_input()
flag = 0
A = []
for c in S:
	A.append(int(c))
for i in range(1,4):
	if A[i-1] == A[i]:
		flag = 1
if flag == 0:
	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):
inp = input()

preve = ""
for st in inp:
    if st == preve:
        print("Bad")
        exit()
    preve = st
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=int(input())

a=S//1000
b=(S-a*1000)//100
c=(S-a*1000-b*100)//10
d=S-a*1000-b*100-c*10
if a!=b and b!=c and c!=d:
    print('Good')
else:
    print('Bad')

Solution (Python):
S = input()

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

Solution (Python):




import sys
import math
from pprint import pprint
import numpy as np


N=input()

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

print('Good')

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

S = [int(x) for x in list(str(Sin))]

test = 0
for i in range(0,3):

    if S[i+1] == S[i]:
        print("Bad")
        test = 1
        sys.exit()
        
if test !=1:
    print("Good")

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

Solution (Python):
S = input()
p = S[0]
ans = 'Good'
for s in S[1:]:
    if s==p:
        ans = 'Bad'
        break
    p = s
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()
lst = []
for i in S:
    lst.append(int(i))
if ((lst[0] == lst[1]) or (lst[1] == lst[2]) or (lst[2] == lst[3])):
    print('Bad')
else:
    print('Good')

Solution (Python):
N = input()
array = list(map(int, N))

count = 0

while count < len(array)-1:
    if array[count] == array[count+1]:
        print("Bad")
        break
    count += 1
else:
    print("Good")

Solution (Python):
S = input()

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

Solution (Python):
S = input()
flag = 0
for i in range(1,len(S)):
    if S[i] == S[i-1]:
        flag = 1
if flag:
    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 = int(input())
A=[]
A.append(int(S/1000))
A.append(int((S-A[0]*1000)/100))
A.append(int((S-A[0]*1000-A[1]*100)/10))
A.append(int((S-A[0]*1000-A[1]*100-A[2]*10)))
if (A[0]!=A[1] and A[1]!=A[2] and A[2]!=A[3]):
    print('Good')
else:
    print('Bad')

Solution (Python):
a=str(input())
b=''
r='Good'
for c in a:
    if b == c:
        r='Bad'
        break
    else:
        b = c
print(r)

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

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

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

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

Solution (Python):
S = input()

ans = 'Good'
for i, j in zip(S,S[1:]):
    if i == j:
        ans = 'Bad'

print(ans)

Solution (Python):
s=input()

res="Good"
pre=""
for c in s:
    if c == pre:
        res="Bad"
        break
    pre = c
print(res)

Solution (Python):
def main():
    s = list(input())
    t = 0
    for i in range(len(s)-1):
        if int(s[i]) == int(s[i+1]):
            t += 1

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

Solution (Python):
s = int(input())
s1 = int(s/10)
s2 = int(s1/10)
s3 = int(s2/10)
a1 = s%10
a2 = s1%10
a3 = s2%10
a4 = s3%10
if a1 == a2 or a2 == a3 or a3 == a4:
	print("Bad")
else:
    print("Good")

Solution (Python):
S=int(input())
if S<100:
    print('Bad')
elif ((S-(S%100))%1100!=0 and (S-(S-(S%1000))-(S%10))%110!=0 and (S%100)%1100!=0):
    print('Good')
else:
    print('Bad')

Solution (Python):
line = input()

chars = list(map(int, line))

result = 0

for char_i in range(1, len(chars)):
  pre_char = chars[char_i-1]
  char = chars[char_i]
  
  if char == pre_char:
    result = 1
    
if result == 0:
  print("Good")
else:
  print("Bad")

Solution (Python):
s = input()
p  = "*"
ans = "Good"
for c in s:
    if c == p:
        ans = "Bad"
    p = c
print(ans)

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

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

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

Solution (Python):
N= str(input())
flag= True
tmp=''

for i in range(4):
  if(tmp == N[i]):
    flag= False
    break
  tmp= N[i]

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

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

flag = True

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


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

Solution (Python):
import sys
inputs = sys.stdin.readlines()

chars = inputs[0]
flag = True
for i in range(1, len(chars)):
  flag = flag and chars[i-1] != chars[i]
  if not flag:
    break

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

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

Solution (Python):
n = str(input())
curr = n[0]
res = 0
for i in range(1, len(n)):
    
    if  n[i] == curr:
        res = 1
    curr = n[i]
        
if res == 1:
    print('Bad')
else:
    print('Good')

Solution (Python):
before = -1
for char in input():
    current = int(char)
    if before == current:
        print("Bad")
        exit()
    else:
        before = current

print("Good")

Solution (Python):
s = input()
a = [int(b) for b in s]

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

Solution (Python):
str = input()
a=str[-4]
b=str[-3]
c=str[-2]
d=str[-1]

if(a is b):
    print("Bad")
elif(b is c):
    print("Bad")
elif(c is d):
    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):
import sys

S = input()

prev = S[0]
i = 1

while i < len(S):
    if prev == S[i]:
        print("Bad")
        sys.exit()
    prev = S[i]
    i += 1

print("Good")

Solution (Python):
s= input()

pre="a"
bad=False

for i in s:
  if i == pre:
    bad=True
  pre = i
  
if bad:
  print("Bad")
else:
  print("Good")

Solution (Python):
N = list(map(int,input()))
bool = 0
for i in range(len(N) - 1):
    if N[i] != N[i+1]:
        bool = 1
    else:
        print("Bad")
        exit()
if bool == 1:
    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 = int(input())
lst = []
while S > 0:
    lst.append(S%10)
    S //= 10 
while(len(lst) <= 4):
  lst.append(0)
  
if lst[0] == lst[1] or lst[1] == lst[2] or lst[2] == lst[3]:
  print("Bad")
else:
  print("Good")

Solution (Python):
def main():

    s = input()
    s = str(s)
    flag = 0

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

if __name__ == '__main__':
    main()

Solution (Python):
s = input()

flg = 0
for i in range(3):
    if s[i] == s[i+1]:
        flg = 1

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

Solution (Python):
import sys

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

if __name__ == "__main__":
    s = list(input())

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

    print("Bad" if is_bad == True else "Good")

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

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

Solution (Python):
S = input().strip()
slist = [int(c) for c in S]

def main():
    tmp = -1
    for s in slist:
        if s == tmp:
            print("Bad")
            return
        else:
            tmp = s
    print("Good")
    return

main()

Solution (Python):
num = input()
num_list = []
for i in num:
    num_list.append(int(i))
index = 0
for i in range(3):
    if num_list[i] == num_list[i + 1]:
        print('Bad')
        exit()
print('Good')

Solution (Python):
strInput = input()

isGood = True
strPreChar = ""
for intIdx in range(len(strInput)):
    if intIdx == 0:
        strPreChar = strInput[intIdx]
    else:
        if strPreChar == strInput[intIdx]:
            isGood = False
            break
        else:
            strPreChar = strInput[intIdx]

print("Good") if isGood 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):

def main():
    k = input()
    flg = False
    for i in range(len(k)-1):
        if k[i] == k[i+1]:
            flg = True
            break
    if flg: print("Bad")
    else: print("Good")

if __name__ == "__main__":
    main()

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(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):
import re
def nchars(s, n):
    """文字列 s に、同じ文字が n 個以上連続している部分文字列を見つける
    """
    assert n > 0
    reg = re.compile("(.)\\1{%d,}" % (n - 1))  
    while True:
        m = reg.search(s)
        if not m:
            break
        yield m.group(0)
        s = s[m.end():]

S = input()
a = list(nchars(S,2))
if len(a)==0:
    print("Good")
else:
    print("Bad")

Solution (Python):



def main():
    S = list(input())
    S.append("_")
    for i in range(len(S)-1):
        
        if S[i] == S[i+1]:
            return "Bad"
    return "Good"
print(main())

Solution (Python):
S = list(input())
S.append("%")
a=0
for i in range(4):
    if ( S[i] == S[i+1]):
        a =1

if a == 1:
    print("Bad")
else:
    print("Good")

Solution (Python):
from sys import stdin

s = stdin.readline().rstrip()
char_list = list(s)
char_len = len(char_list)
tmp = ""


for i, c in enumerate(char_list):
    if tmp == c:
        print("Bad")
        break

    if i == char_len-1:
        print("Good")
    tmp = c

Solution (Python):
N =str(input())
pre = "a"
count = 0
for i in range(4):
    if N[i] == pre:
        count += 1
    pre = N[i]
if count > 0:
    print('Bad')
else:
    print('Good')

Solution (Python):
x = input()
x = str(x)
f = True

for i in range(1,4):
  if(x[i-1] == x[i]):
    f = False
    break
   
if f:
  print("Good")
else:
  print("Bad")

Solution (Python):
s = input()

compare = s[0]
result = 'Good'

for i in s[1:]:
  if i == compare:
    result = 'Bad'
  
  compare = i
  
print(result)

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

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

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

Solution (Python):
inp = str(input())
def a(inp):
    for x in range(3):
    
        if inp[x]==inp[x+1]:
            return 'Bad'
    return 'Good'
print(a(inp))

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

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

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

Solution (Python):
S = input()
temp = ""
for c in S:
  if c == temp:
    print("Bad")
    exit(0)
  temp = c
print("Good")

Solution (Python):
S = input()

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

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

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

print("Good")

Solution (Python):
a = input()
b = list(a)

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

Solution (Python):
import math

a = list(map(int, input().split()))
a = a[0]

x=a%10
y=a//10%10
z=a//100%10
w=a//1000

if(x!=y and y!= z and z!= w):
    print("Good")
else:
    print("Bad")

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

tmp = ''
s = 'Good'

for v in S:
    if tmp == v:
        s = 'Bad'

    tmp = v

print(s)

Solution (Python):
import math
abcd= int(input())
a=math.floor(abcd/1000)
abcd = abcd - a*1000
b=math.floor(abcd/100)
isbad = False
if b==a:
    isbad = True

abcd = abcd - b*100
c=math.floor(abcd/10)
if c==b:
    isbad = True

d = abcd - c*10
if d==c:
    isbad = True

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

Solution (Python):
num = str(input())
ans =""

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

print(ans)

Solution (Python):
a = input()

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

Solution (Python):
sec_number = input()
answer = False
for i in range(1,4):
  if sec_number[i] == sec_number[i-1]:
    answer = True
if answer:
  print("Bad")
else:
  print("Good")

Solution (Python):
S = input()

def long_repeat(line):

    max = 0
    cnt = 1

    for i in range(len(line)-1):
        if cnt > 1:
            cnt -= 1
            continue
        for j in range(i+1,len(line)):
            if line[i] == line[j]:
                cnt += 1
            else:
                break
        if max < cnt:
            max = cnt

    return max

if long_repeat(S) >=2:
    print("Bad")
else:
    print("Good")

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

Solution (Python):

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

Solution (Python):
import sys

def solve(code):
    pre = ''
    for i in range(len(code)):
        if pre == code[i]:
            return 'Bad'
        pre = code[i]

    return 'Good'


if __name__ == '__main__':

    code = sys.stdin.readline().strip()
    print solve(code)

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

Solution (Python):
a = input()

prev = a[0]

flag = False

for i in range(1, 4):
  if (prev == a[i]):
    flag = True
    break
  prev = a[i]

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

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

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

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

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

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

Solution (Python):
kekka = 0
moji = 10
inp = input()

for i in inp:
    if i == moji:
        kekka = 1
        break
    else:
        moji = i

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

Solution (Python):

s = input()
check = -1
flag=0
for i in range(len(s)):
    if s[i]==check:
        flag=1
        break;
    check=s[i]
if flag ==0:
    print('Good')
else:
    print('Bad')

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

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

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

Solution (Python):
a = list(map(int, 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()
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 = str(s)

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

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

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

Solution (Python):
n = input()

s = []
for a in n:
    s.append (int(a))

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

Solution (Python):
S = input()

n=100
check=0

for i in S:
    if i==n:
        check=1
    
    n=i

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

Solution (Python):
import sys
s=list(input())
for i in range(3):
    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):
s = input()
c = s[0]
h = True
for i in range(1,4):
    if c == s[i]:
        print('Bad')
        h = False
        break
    else:
        c = s[i]
if h : print('Good')

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

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

tmp = S.pop(0)
for i in S:
    if tmp == i:
        print('Bad')
        break
    tmp = i
else:
    print('Good')

Solution (Python):
s = input()

pre = 'a'
dame = 0

for i in s:
    if pre == i:
        dame = 1
    pre = i

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

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

Solution (Python):
s = input()

flag = False

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

if flag :
	result = " Bad"
else:
	result = "Good"

print(result)

Solution (Python):
def main():
    s = input()
    if solve(s):
        print('Good')
    else:
        print('Bad')

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

main()

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

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

Solution (Python):
s = input()

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

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

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

Solution (Python):
s = input()
n_1= ''
judge = True

for n in s:
    if n == n_1:
        judge = False
    else:
        pass
    n_1 = n

if judge:
    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'
        break
print(ans)

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

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

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

tmp = ''
for i in S:
    if tmp == i:
        print('Bad')
        exit()
    tmp = i

print('Good')

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

s = str(input())

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

Solution (Python):
S = int(input())
s1 = (S-S%1000)/1000
k1 = S - s1*1000
s2 = (k1-k1%100)/100
k2 = k1 - s2*100
s3 = (k2-k2%10)/10
s4 = S - (s1*1000 + s2*100 + s3*10)

if s1 == s2 or s2 == s3 or s3 == s4:
    print("Bad")
else:
    print("Good")

Solution (Python):
S = input()

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

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

Solution (Python):


p=str(input())
c = 0
for i in range(0,len(p)-1):
    if (int(p[i+1]) - int(p[i])) == 0:
        c+=1
    else:
        pass
if c !=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")
        quit()

print("Good")

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

A()

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

n=[s[0]]
for i in range(1,4):
    if s[i]!=n[-1]:
        n.append(s[i])
    else:
        print("Bad")
        exit()
if len(n)==4:
    print("Good")

Solution (Python):
s = input()

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

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

print(ans)

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

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

Flag = True

if (S//1000) == ((S%1000)//100) or ((S%1000)//100) == ((S%100)//10) or ((S%100)//10) == ((S%10)//1):
  Flag = False
  
if Flag == False:
  print("Bad")
else:
  print("Good")

Solution (Python):
S = input()
a=S[0]
result = 'Good'
for i in range(1,len(S)):
  if(S[i]==a):
      result='Bad'

  else:
      a=S[i]

print(result)

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

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

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

sl = []

for i in range(4):
    sen = s // 1000
    hyaku = (s - sen * 1000) // 100
    ju = (s - sen * 1000 - hyaku * 100) // 10
    ichi = s % 10

if sen == hyaku or hyaku == ju or ju == ichi:
    print("Bad")
    exit()

print("Good")

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

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

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

Solution (Python):
S=input()
x=str(S)
if x[0]==x[1]:
	print('Bad')
elif x[1]==x[2]:
	print('Bad')
elif x[2]==x[3]:
	print('Bad')
else:
	print('Good')

Solution (Python):
import sys

s = input()

oldNum = '-1'
isBad = False
for num in s :
    if oldNum == num :
        isBad = True
        break
    
    oldNum = num

if isBad == True :
    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):
S=input()
flag=0

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

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