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

ans = 0

for i in [0, 1, 2]:
  if s[i] == s[i + 1]:
    ans += 1
    
if ans >= 1:
  print('Bad')
else:
  print('Good')

Submission status: Accepted

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

bool = True
for i in range(3):
    if s[i] == s[i+1]:
        bool = False
    else:
        continue
print('Good' if bool else '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 = open(0).read()
prev_s=S[0]
for s in S[1:]:
    if s == prev_s:
        print("Bad")
        break
    prev_s = s 
else:
    print("Good")

Submission status: Accepted

Solution code:
a = input()

print("Good" if len([None for i in range(len(a) - 1) if a[i] == a[i + 1]]) == 0 else "Bad")

Submission status: Accepted

Solution code:
def main():
    S = input()
    for i in range(3):
        if S[i] == S[i+1]:
            return "Bad"
    return "Good"
    
if __name__ == '__main__':
    print(main())

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 = str(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()
ans='Good'
for i in range(3):
    if s[i]==s[i+1]:
        ans='Bad'
        break
print(ans)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    s = input()
    pre = ''
    for i in list(s):
        if pre == i:
            print('Bad')
            break
        pre = i
    else:
        print('Good')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

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

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

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

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()
a = 0
for i in range(3):
    if s[i]==s[i+1]:
        print("Bad")
        a = 1
        break
if a == 0:
    print("Good")

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()
t= "Good"

for i in range(0,len(s)):
    if s.find(s[i],i+1) == i+1:
        t="Bad"
print(t)

Submission status: Accepted

Solution code:
S = input()
flg = True

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

print('Good') if flg == True else print('Bad')

Submission status: Accepted

Solution code:
A = str(input())
count = 0
for i in range(1,4):
	if A[-i]==A[-i-1]:
		count += 1
if count == 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:
s=input()
r='Good'
for i in range(3):
    if s[i]==s[i+1]:
        r='Bad'
        break
print(r)

Submission status: Accepted

Solution code:
import sys

S = str(input())

before = ''
for s in S:
    if s == before:
        print('Bad')
        sys.exit()
    before = s
print('Good')

Submission status: Accepted

Solution code:
a=input()
if a[0]==a[1] or a[2]==a[1] or a[2]==a[3]:
  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()

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

print(checkDigits(S))

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:
S = list( 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] and S[1]!=S[2] and S[2]!=S[3]:
  print('Good')
else:
  print('Bad')

Submission status: Accepted

Solution code:
password = list(input())
for i in range(3):
    if password[i] == password[i+1]:
        print("Bad")
        break
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")
        exit()
print("Good")

Submission status: Accepted

Solution code:
lst=input()
flg=True
for i in range(3):
    if lst[i]==lst[i+1]:
        flg=False
print("Good" if flg else "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()
K=str(S)
count = 0
for i in range(len(K)-1):
    if K[i]==K[i+1]:
        count += 1
if count == 0:
    print("Good")
else:
    print("Bad")

Submission status: Accepted

Solution code:
s = str(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:
def examA():
    S = SI()
    ans = "Good"
    for i in range(len(S)-1):
        if S[i+1]==S[i]:
            ans = "Bad"
    print(ans)
    return

def examB():
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

if __name__ == '__main__':
    examA()

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]:
        ans = "Bad"
        break
else:
    ans = "Good"

print(ans)

Submission status: Accepted

Solution code:
s = input()
tmp = s[0]
check = True
for i in range(1, len(s)):
    if tmp == s[i]:
        check = False
    tmp = s[i]
if check:
    print("Good")
else:
    print("Bad")

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

Submission status: Accepted

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

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:
a = input()
b = a[0]
for i in range(1,4):
  if b == a[i]:
    print("Bad")
    break
  b=a[i]
else:
  print("Good")

Submission status: Accepted

Solution code:
S = str(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:
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:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

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

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

Submission status: Accepted

Solution code:
import sys

string = input()

previous = "-" #impossible
for ch in string:
  if previous == ch:
    print("Bad")
    sys.exit(0)
  previous = ch

print("Good")

Submission status: Accepted

Solution code:
S = input()

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

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,b,c,d=map(int,input())
if a==b or b==c or d==c:
    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()
for i in range(1,4):
    if s[i]==s[i-1]:
        print("Bad")
        break
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")
        exit()

print("Good")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
if s[0]!=s[1]!=s[2]!=s[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:
s=input()
for i in range(1,4):
    if int(s[i-1])==int(s[i]):
        print("Bad")
        exit()
print("Good")

Submission status: Accepted

Solution code:
S = list(map(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()+"t"
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())
ans = "Good"
for i in range(0, 3):
    if S[i] == S[i+1]:
        ans = "Bad"
        break
print(ans)

Submission status: Accepted

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

S = input()

ans = False
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
    ans = True

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

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:
S = str(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:
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:
n=list(map(int,input()))
count=0
for i in (range(3)):
    if n[i]==n[i+1]:
        count+=1
if count>=1:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

Solution code:
import sys
import math

MOD = 10 ** 9 + 7


def main():
    S = input()

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

    print('Good')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = input()
for i in range(0, 3):
  if n[i] == n[i+1]:
    print("Bad")
    exit(0)
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")
    exit(0)
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=int(input())
P=str(s).zfill(4)
if (P[0]==P[1]) or (P[1]==P[2]) or (P[2]==P[3]):
  print("Bad")
else:
  print("Good")

Submission status: Accepted

Solution code:
s = input()

cnt = 0
for i in range(3):
    if s[i] == s[i+1]:
        cnt += 1
if cnt:
    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 = list(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 = list(input())
Flag = True
for i in range(0,3):
  a = S[i]
  b = S[i+1]
  if a == b:
    Flag = False
if Flag == True:
  print('Good')
else:
  print('Bad')

Submission status: Accepted

Solution code:
# coding:utf-8
# Author:Code
s = raw_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:
# coding: utf-8 
#Author:Code
s = raw_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 = raw_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:
# Security
S = list(input())
res = 'Good'
for i in range(3):
    if S[i] == S[i+1]:
        res = 'Bad'
print(res)

Submission status: Accepted

Solution code:

S = list(input())
count = 0
bad = False

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


#print(bad)

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

Submission status: Accepted

Solution code:
S=int(input())
n=1
while n>0.001:
    if S//(1000*n)==(S-(1000*n)*(S//(1000*n)))//(100*n):
        print("Bad")
        break
    else:
        S=S-(1000*n)*(S//(1000*n))
        n=n/10
else:
    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:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math
import datetime

# 入力
#N = int(input())
#S = str(input())
#H, W = map(int, input().split())
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:
# -*- coding: utf-8 -*-

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:
a, b, c, d = input()

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

Submission status: Accepted

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

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 = input()
a = S[0]
out = "Good"
for i in range(1, len(S)):
    if S[i] ==  a:
        out = "Bad"
    a = S[i]

print(out)

Submission status: Accepted

Solution code:
s = input()
flag = 1

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

if flag == 1:
    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]:
  ans = False
else:
  ans = True
  
if ans:
  print("Good")
else:
  print("Bad")

Submission status: Accepted

Solution code:
S = [int(x) for x in list(input())]

for i in [0, 1, 2]:
    if S[i] == S[i + 1]:
        print("Bad")
        exit()

print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())
cnt = 0

for i in range(1, len(S)):
  if S[i] == S[i-1]:
    cnt += 1
    
if cnt >= 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')
    exit()
print('Good')

Submission status: Accepted

Solution code:
#Seculity
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()
ans = 'Good'
for i in range(3):
        if s[i] == s[i+1]:
                ans = 'Bad'    
print(ans)

Submission status: Accepted

Solution code:
S = list(input())

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

prev = ''
ans = 'Good'

for char in s:
  if char == prev:
    ans = 'Bad'
    break
  prev = char

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = list(map(int,input()))
Flag = True

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

Submission status: Accepted

Solution code:

def main():
    s = input()
    for i in range(len(s) - 1):
        if(int(s[i]) - int(s[i+1]) == 0):
            print("Bad")
            return
    print("Good")

main()

Submission status: Accepted

Solution code:
S = input()
for i in  range(1,len(S)):
    if S[i-1] == S[i]:
        print('Bad')
        exit()
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:
s = input()
flag = False
for i in range(3):
    if s[i] == s[i + 1]:
        flag = True
print('Bad' if flag else 'Good')

Submission status: Accepted

Solution code:
s = input()
pre = s[0]
res ="Good"
for str in s[1:]:
  if str == pre:
    res = "Bad"
  pre = str
    
print(res)

Submission status: Accepted

Solution code:
S = input()
ans = 'Good'
for i,n in enumerate(S):
    if i < 3:
        if n == S[i+1]:
            ans = 'Bad'
print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def print_ans(S):
    """Test Case
    >>> print_ans("3776")
    Bad
    >>> print_ans("8080")
    Good
    >>> print_ans("1333")
    Bad
    >>> print_ans("0024")
    Bad
    """
    flg = True
    tmp = ""
    for s in S:
        if tmp == s:
            flg = False
            break
        tmp = s
    if flg:
        print("Good")
    else:
        print("Bad")



if __name__ == '__main__':
    S = input().rstrip()
    print_ans(S)

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

Submission status: Accepted

Solution code:
s=input()
p = ''
flg = 0
for i in s:
    if i == p:
        flg+=1
    p = i
print("Bad" if flg != 0 else "Good")

Submission status: Accepted

Solution code:
c = input()
num = list(c)

if num[0] == num[1]:
    print('Bad')
elif num[1] == num[2]:
    print('Bad')
elif num[2] == num[3]:
    print('Bad')
else:
    print('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:
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:
#!/usr/bin/env python3
import sys, math
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans=count=0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict,deque, Counter
import sys,heapq,bisect,math,itertools,string,queue,copy,time
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
ans = 'Good'

S = input()
for _ in range(len(S)-1):
    if S[_] == S[_+1]: ans = 'Bad'


print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def inpl():
    return list(map(int, input().split()))


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:
# 2019-11-14 20:54:46(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
# import numpy as np 

def main():
    s = sys.stdin.readline().rstrip()
    for i in range(3):
        if s[i] == s[i+1]:
            ans = 'Bad'
            break
    else:
        ans = 'Good'
    
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()

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

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

Submission status: Accepted

Solution code:
s = list(input())
pre = ""
ans = "Good"
for i in s:
  if pre == i:
    ans = "Bad"
  pre = i
print(ans)

Submission status: Accepted

Solution code:
#%%
import sys
def input():
    return sys.stdin.readline().rstrip()

def main():
    S = input()
    p = 'a'
    for c in S:
        if c is p:
            print('Bad')
            break
        else:
            p = c
    else:
        print('Good')

# %%
if __name__ == '__main__':
    main()

# %%
# from atcoder_test import doTest
# doTest("abc131","a",main)

Submission status: Accepted

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

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

flg = True

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

if flg:
    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()
a = True
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        a = False

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
c = True
for n in range(len(S)-1):
    if S[n] == S[n+1]:
        c = False
if c:
    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()

#文字列nを１文字ずつリストに入れる
#l = [0]*4 これは不要
l = list(n)

#print(l)

ans = 'Good'

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

print(ans)

Submission status: Accepted

Solution code:
s=list(str(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:
s = str(input())

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

print(res)

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:
import re

s = input()

if re.search(r"(.)\1", s):
    print("Bad")
else:
    print("Good")

Submission status: Accepted

Solution code:
S=str(input())
count = 0
for i in range(4):
    count+=1
    if S[i:i+1]==S[i+1:i+2]:
        print('Bad')
        break
    elif count == 3:
        print('Good')

Submission status: Accepted

Solution code:
import sys

s = input()

before_s = ""
for ss in s:
    if ss == before_s:
        print("Bad")
        sys.exit()
    before_s = ss

print("Good")

Submission status: Accepted

Solution code:
ls_s = [i for i in input()]

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

Submission status: Accepted

Solution code:
s = list(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:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    from itertools import groupby
    G=groupby(input())
    print("Good" if(len(list(G))==4) else "Bad")
resolve()

Submission status: Accepted

Solution code:
import unittest


class TestA(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think('3776'), 'Bad')

    def test_2(self):
        self.assertEqual(think('8080'), 'Good')

    def test_3(self):
        self.assertEqual(think('1333'), 'Bad')

    def test_4(self):
        self.assertEqual(think('0024'), 'Bad')


def solve():
    s = read()
    result = think(s)
    write(result)


def read():
    length_of_string = 4
    return read_line(n=length_of_string)


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(data):
    for i in range(len(data) - 1):
        if data[i] == data[i + 1]:
            return 'Bad'
    return 'Good'


def write(result):
    print(result)


if __name__ == '__main__':
    # unittest.main()
    solve()

Submission status: Accepted

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