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



Sample input:
3776


Sample output:
Bad

Submission status: Accepted

Solution code:
from copy import *
from sys import *
import math
import queue
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)

#dp[i][j]: iまでからj枚えらんで和がkになるのは何通り
def main():
	s = input()
	if(s[0] == s[1] or s[1] == s[2]  or s[2]== s[3]):
		print('Bad')
	else:
		print('Good')

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(m,n):
	x = max(m,n)
	y = min(m,n)
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	return y

class queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
# ABC131A - Security
def main():
    s = input()
    flg = all(i != j for i, j in zip(s, s[1:]))
    print("Good" if flg else "Bad")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# ABC131A - Security
def main():
    s = input()
    if all(i != j for i, j in zip(s, s[1:])):
        print("Good")
    else:
        print("Bad")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = list(input())
j = 0
for l in range(0, len(line) - 1):
  if line[l] == line[l + 1]:
    j += 1
if j == 0:
  print('Good')
else:
  print('Bad')

Submission status: Accepted

Solution code:
S = int(input())
a = int(S / 1000)
b = int(S % 1000 / 100)
c = int(S % 100 / 10)
d = int(S % 10)
if (a == b) or (b == c) or (c == d):
    print('Bad')
else:
    print('Good')

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

flg = 0
temp = 0

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

if flg == 0:
    print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
S = input()

for i in range(1,4):
  if S[i-1] != S[i]:
    pass
  else:
    print('Bad')
    exit()
print('Good')

Submission status: Accepted

Solution code:
a=list(input())

ans=0
for i in range(int(len(a))-1):
    if a[i]==a[i+1]:
        ans+=1
    else:
        ans+=0

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

Submission status: Accepted

Solution code:
n =input()

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

Submission status: Accepted

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

Submission status: Accepted

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

print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def A_Security():
    S = list(input())
    output = "Good"
    for x in range(len(S)-1):
        if S[x] == S[x+1]:
            output = "Bad"
    print(output)
    
if __name__ =="__main__":
    A_Security()

Submission status: Accepted

Solution code:
def solve(string):
    return "Bad" if any([s1 == s2 for s1, s2 in zip(string, string[1:])]) else "Good"


if __name__ == '__main__':
    print(solve(input()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
_input = input()
S = _input

tmp = None
ans = 'Good'
for s in S:
    if s == tmp:
        ans = 'Bad'
        break
    tmp = s

print(ans)

Submission status: Accepted

Solution code:
S = input()
S = list(map(int,S))
prior = None
ans = 'Good'
for i in S:
  if prior == i:
    ans = 'Bad'
    break
  else:
    prior = i
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import io
import sys


def IN_S():
  return input()


def IN_I():
  return int(input())


def IN_L_I():
  return list(map(int, input().split()))


def IN_L_S():
  return list(map(str, input().split()))


def STR_SPLIT(s, n):
  for l in range(0, len(s), n):
    yield s[0 + l:n + l]


def T_IN():
  global test_str
  sys.stdin = io.StringIO(test_str[1:-1])


test_str = '''
1234
'''


def MAIN():
  # T_IN()
  A()


def A():
  s = IN_S()

  p = ""
  for i in s:
    if len(p) != 0:
      if p == i:
        print("Bad")
        exit()
    p = i

  print("Good")


  return None
 

def B():
  return None


def C():
  return None


MAIN()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
S = input()

pat = r"(\d)\1"

res = re.search(pat, S)


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

Submission status: Accepted

Solution code:
s = list(str(input()))

flag = True
pre = None
for i, value in enumerate(s):
  if i != 0:
    if pre == value:
      flag = False
      break

  pre = value
    
if flag:
  print("Good")
else:
  print("Bad")

Submission status: Accepted

Solution code:
st = input()

b = [x for x,y in zip(st, st[1:]) if x==y]

if len(b) == 0:
    print('Good')
else:
    print('Bad')

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()

count = 0

for i in range(len(s)-1):
    diff = int(s[i]) - int(s[i+1])
    if diff == 0:
        count += 1
    else:
        count += 0

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

Submission status: Accepted

Solution code:

S = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

def main():
    S = input()
    flag = 1
    for i in range(1, len(S)):
       if S[i] == S[i-1]:
           print("Bad")
           flag=0
           break
       else:
           pass
    if flag:
        print("Good")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import logging

logging.basicConfig(level=logging.INFO, format="%(message)s")
logging.disable(logging.CRITICAL)

def main():
    pass_num = input()
    for i in range(3):
        if pass_num[i] == pass_num[i + 1]:
            print("Bad")
            exit()

    print("Good")
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math, string, itertools, fractions, heapq, collections, re, array, bisect, copy, functools, random
import sys
from collections import deque, defaultdict, Counter; from heapq import heappush, heappop
from itertools import permutations, combinations, product, accumulate, groupby
from bisect import bisect_left, bisect_right, insort_left, insort_right
from operator import itemgetter as ig
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20; INF = float("INF"); ans = 0; tmp = 0; ansli = []; tmpli = []; candili = []
eps = 1.0 / 10 ** 10; mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]; ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]; ddn9 = ddn + [(0, 0)]
"""for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:"""
def wi(): return list(map(int, sys.stdin.readline().split()))
def wip(): return [int(x) - 1 for x in sys.stdin.readline().split()]#WideIntPoint
def ws(): return sys.stdin.readline().split()
def i(): return int(sys.stdin.readline())
def s(): return input()
def hi(n): return [i() for _ in range(n)]
def hs(n): return [s() for _ in range(n)]#HeightString
def mi(n): return [wi() for _ in range(n)]#MatrixInt
def mip(n): return [wip() for _ in range(n)]
def ms(n): return [ws() for _ in range(n)]

s = s()

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

Submission status: Accepted

Solution code:
cord = list(input())
cord_len = len(cord)
for i in range(cord_len - 1):
    if cord[i] == cord[i + 1]:
        print("Bad")
        break
else:
    print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main07():
    data = input()
    hantei = True
    for i in range(3):
        if data[i] == data[i+1]:
            hantei = False
    if hantei:
        print("Good")
    else:
        print("Bad")
    
if __name__ == "__main__":
    main07()

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
a = input()

for b in range(0,len(a)-1):
    if a[b] == a[b+1]:
        print('Bad')
        break
else:
    print('Good')

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = input()

l = len(S)

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

Submission status: Accepted

Solution code:
S = input()

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

else:
    print("Good")

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
import sys
S=input()
for i in range(1,len(S)):
    if S[i-1]==S[i]:
        print("Bad")
        sys.exit()
print("Good")

Submission status: Accepted

Solution code:
s = input()
bad = False
for i, v in enumerate(s[:-1]):
  if s[i+1] == v:
    bad = True
print("Bad" if bad else "Good")

Submission status: Accepted

Solution code:
S = input()
cnt = 0

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

if cnt == 0:
    print("Good")

Submission status: Accepted

Solution code:
#ABC131a

s=input()

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

Submission status: Accepted

Solution code:
s=input();a=[eval(s[i+1]+"-"+s[i]) for i in range(3)];print("GBoaodd"[a.count(0)!=0::2])

Submission status: Accepted

Solution code:
dnumber = input()
for a in range(0, len(dnumber)-1):
    if dnumber[a] == dnumber[a+1]:
        print('Bad')
        break
else:
    print('Good')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
bef = ''
for i in S:
        if bef == '':
                bef = i
                continue
        else:
                if i == bef:
                        print('Bad')
                        exit()
                else:
                        bef = i

print('Good')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

if result == 0:
    print("Good")
else:
    print("Bad")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nums = list(map(int,list(input())))

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

Submission status: Accepted

Solution code:
prev = ""
flg = False
for i in input():
    if flg == True:
        break
    elif prev == i:
        flg = True
    prev = i

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

Submission status: Accepted

Solution code:
S=input()
isBad=False
for i in range(1,len(S)):
    if S[i]==S[i-1]:
        isBad=True
if isBad:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = input()

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

Submission status: Accepted

Solution code:
S = [int(a) for a in 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")

Submission status: Accepted

Solution code:
S = input()
l = list(S)
count = 0
for i in range(1,4) :
  if l[i] == l[i-1] :
    count += 1
  else :
    pass
if count == 0 :
  print('Good')
else :
  print('Bad')

Submission status: Accepted

Solution code:
S = str(input())
S = [S[i] for i in range(len(S))]
n1 = None
for i in S:
    n2 = i
    if n1==n2:
        print('Bad')
        exit()
    else:
        n1 = i
        continue
print('Good')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(map(str,input().split()))
i = a[0]

lst = list(i)

flag = 0;
for k in range(3):
  if lst[k] == lst[k+1]:
    flag = 1
    
if flag == 1:
  print("Bad")
else:
  print("Good")

Submission status: Accepted

Solution code:
n = input()
flag = 0
for i in range(len(n)-1):
    if n[i] == n[i+1]:
        flag = 1

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

Submission status: Accepted

Solution code:
s = str(input())

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

print(ans)

Submission status: Accepted

Solution code:
securityCode = input()

t = 0

for i in range(3):
  if securityCode[i] == securityCode[i+1]:
    t = 1

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

Submission status: Accepted

Solution code:
x =  [int(s) for s in  list(input())]
num = []
for s in x:
    if(len(num) == 0):
        num.append(s)
    else:
        if(num[len(num)-1] == s):
            print('Bad')
            break
        else:
            num.append(s)

if(len(num) == 4):print('Good')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#131
#文字入力
str = input() 

#文字列の長さ取得
str_leg = len(str)


#判定

check = 1; 

for i in range(0, str_leg - 1):
    for j in range(i+1, str_leg):
        if (str[i] == str[j] and j == i + 1) :
             check = 0; 

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

Submission status: Accepted

Solution code:
import sys
i = input()
i = list(map(int,list(i)))
for k in range(3):
  if i[k] == i[k+1]:
    print("Bad")
    sys.exit()
print("Good")

Submission status: Accepted

Solution code:
s = input()
checker = True
for i in range(3):
    a , b = int(s[i]), int(s[i+1])
    if a == b:
        checker=False

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

Submission status: Accepted

Solution code:
print("Bad" if [sum([x[i]==x[i+1] for i in range(len(x)-1)]) for x in [str(input())]]!=[0] else "Good")

Submission status: Accepted

Solution code:
print("Bad" if [ x[0]==x[1] or x[1]==x[2] or x[2]==x[3] for x in [str(input())] ] == [1] else "Good")

Submission status: Accepted

Solution code:
import re
s = input()
pattern = r"(00|11|22|33|44|55|66|77|88|99)"
if(re.search(pattern, s)):
	print("Bad")
else:
	print("Good")

Submission status: Accepted

Solution code:
s = input()
x = [s[i:i+1] for i in range(len(s))]
if x[0] != x[1] and x[1] != x[2] and x[2] != x[3]:
    print("Good")
else:
    print("Bad")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l_s = list(map(int,input()))
n = len(l_s)
for i in range (1,n):
    if l_s[i]==l_s[i-1]:
        print('Bad')
        break
else:
    print('Good')

Submission status: Accepted

Solution code:
S = input()
check = 0

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

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
n= input()
n_list=list(n)
ans=0
a=0
for i in range(3):
    if n_list[a]==n_list[a+1]:
        ans=1
    else:
        a+=1
if ans==1:
    print("Bad")
else :
    print("Good")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
pas = input()
for pre, pos in zip(pas[:-1], pas[1:]):
  if pre == pos:
    print('Bad')
    break
else:
  print('Good')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()


def check(s):
    ret = 'Good'
    pre = None
    for c in s:
        if c == pre:
            ret = 'Bad'
            break;
        else:
            pre = c
    return ret
        
print(check(S))

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    S = input("")
    oldi = -1
    for i in S:
        if i == oldi:
            print("Bad")
            exit()
        oldi = i
    print("Good")

Submission status: Accepted

Solution code:
S = list(input())
# n, k = list(map(int, input().split()))

flag = True

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

if flag:
    print("Good")

Submission status: Accepted

Solution code:
S = list(input())
answer = ""
check = S[0]
flag = True
for i in range(1,len(S)):
    if(check == S[i]):
        flag = False
        answer = "Bad"
        break
    else:
        check = S[i]
if(flag):
    answer = "Good"
print(answer)

Submission status: Accepted

Solution code:
S = input()
n = ""
ans = "Good"
for i in range(4):
    if S[i:i+1]==n:
        ans = "Bad"
        break
    n = S[i:i+1]
print(ans)

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=int(input())
A=[]
i=0
for x in range(0,4):
    A.append(S%10)
    S=S//10
if A[0]==A[1]:
    i=1
if A[1]==A[2]:
    i=1
if A[2]==A[3]:
    i=1
if i==0:
    print("Good")
else:
    print("Bad")

Submission status: Accepted

Solution code:
import sys
S = input()

prev = ""
for i in S:
  if i == prev:
    print("Bad")
    sys.exit(0)
  prev = i
  
print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
isGood = True
tmp = ''
for i in s:
    if i == tmp:
        isGood = False
    tmp = i
if isGood == True:
    print('Good')
else:
    print('Bad')

Submission status: Accepted

Solution code:

s = input()

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

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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

Solution code:
S = input()
tmp = ""
for s in S:
    if tmp == s:
        print("Bad")
        exit()
    tmp = s
print("Good")

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    s = inputs[0]

    prev_c = s[0]

    for i in range(1, len(s)):
        if prev_c == s[i]:
            return "Bad"
        prev_c = s[i]

    return "Good"


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Submission status: Accepted

Solution code:
s = input()

before_k = ''
flag = True
for k in s:
  if before_k == k:
    flag = False
  before_k = k

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=str(input () )
B=0
while B!=3:
    if A[B]==A[B+1]:
        print('Bad')
        break
    else:    
        B=B+1
else:
    print('Good')

Submission status: Accepted

Solution code:
n = input()
n_ = [int(i) for i in n]
if n_[0]==n_[1] or n_[1]==n_[2] or n_[2]==n_[3]:
  print("Bad")
else:
  print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
a = int(input())
b = a%10
c = int(((a-b)/10)%10)
d = int(((a-b-c*10)/100)%10)
e = int(((a-b-c*10-d*100)/1000)%10)
mylst = [e, d, c, b]
if e == d:
    print("Bad")
elif d == c:
    print("Bad")
elif c == b:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

Solution code:
num = input()
if any([i == j for i, j in zip(num[:-1], num[1:])]):
    print('Bad')
else:
    print('Good')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=list(map(int,list(input())))
frg=True
for n,s in enumerate(S):
    if n!=0:
        if S[n-1]==s:
            frg=False
            break
print("Good") if frg else print("Bad")

Submission status: Accepted

Solution code:
s=input()
for i in range(3):
    if s[i]==s[i+1]:
        print("Bad");quit()

print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
a = 0
for i in range(1,4):
    if s[i]==s[i-1]:
        print('Bad')
        a = 1
        break
if a == 0:
    print('Good')

Submission status: Accepted

Solution code:
S = input()
ss = list(S)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s=list(map(int, input()))
u=0
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        print("Bad")
        break
    else:    u+=1
    if u == len(s) -1:
        print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
str = 'Good'
if (S[0] == S[1] or S[1] == S[2] or S[2] == S[3]):
  str = 'Bad'
print(str)

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

Solution code:
import collections


S = list(input())

answer = 'Good'
for i in range(1, len(S)):
  if S[i] == S[i-1]:
    answer = 'Bad'

print(answer)

Submission status: Accepted

Solution code:
list = [int(x)for x in input()]
count =0
for i in range(3):
  if list[i] == list[i+1]:
    count +=1
if count ==0:
  print('Good')
else:
  print('Bad')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = ''
b = True
for x in list(input()):
    if a == x:
        b = False
    a = x
if b:
    print('Good')
else:
    print('Bad')

Submission status: Accepted

Solution code:
a = ''
b = True
for x in list(input()):
    if a == x:
        b = False
        break
    a = x
if b:
    print('Good')
else:
    print('Bad')

Submission status: Accepted

Solution code:
def chechcode(code):
    a = None
    for i in code:
        if a == i:
            return "Bad"
        a = i
    return "Good"

code = input()
print(chechcode(code))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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