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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

tmp = ''
s = 'Good'

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

    tmp = v

print(s)

Submission status: Accepted

Solution code:
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')
# print(a,b,c,d)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 文字列の入力
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')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A問題
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()
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')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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")
        exit()
print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

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

print('Good')

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
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")

Submission status: Accepted

Solution code:
S = input()

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

print("Good")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()		# 文字列の入力  abcdefg...

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
S=input()
#print(type(S[0]))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

judge()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
# N = list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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)

Submission status: Accepted

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

Submission status: Accepted

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

#n=int(input())  
#n,l=map(int,input().split())
#a=[int(i) for i in input().split()]
#a=[l+i-1 for i in range(1,n+1)]
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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))  # type: str
    solve(S)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = str(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()
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
flag=False

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

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 = 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')

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()

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

print('Good')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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]

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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()
C = 0
for i in range(3):
	if S[i] == S[i+1]:
		C = 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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