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

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

for i in range(10):
	if str(i) * 2 in s:
		print('Bad')
		break
else: print('Good')

Submission status: Accepted

Solution code:

S = input()

n1 = S[0]

for n2 in S[1:]:
  if n2 == n1:
    print("Bad")
    exit()
  n1 = n2
print("Good")

Submission status: Accepted

Solution code:
a,b,c,d = input()
print("Good" if a!=b!=c!=d else "Bad")

Submission status: Accepted

Solution code:
S=input()
tmp=10
ans='Good'
for s in S:
    if s == tmp: ans='Bad'; break
    else: tmp=s
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding:utf-8 -*-

def main():
  s = input().strip()
  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:
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:
s = input()
print('Bad' if any(s[i] == s[i + 1] for i in range(3)) else 'Good')

Submission status: Accepted

Solution code:
import os, sys, re, math

S = input()

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

print(result)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()

for i in range(0,len(s)-1):
    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[1] == S[2] or S[2] == S[3] :
    print("Bad")
else :
    print("Good")

Submission status: Accepted

Solution code:
import sys
s = list(input())

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

print("Good")

Submission status: Accepted

Solution code:
# coding: utf-8

number = input()
ans = 0
for i in range(len(number)-1):
    if number[i] == number[i + 1]:
        ans += 1
    else:
        pass
if ans > 0:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

Solution code:
S = input()

temp2 = 0
for i in range(0,10):
    temp1 = S.count(str(i)*2)
    if temp1 > 0:
        temp2 += 1

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

Submission status: Accepted

Solution code:
S = input()
judge = 0

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

Submission status: Accepted

Solution code:
S=input()
cnt=0

for n in range(0,3):
    if S[n]==S[n+1]:
        cnt+=1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input())

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
S=list(input())
#print(
def renzoku(s):
        
    while True: 
        for i in range(len(S)-1):
            if S[i]==S[i+1]:
                return 'Bad'
                #break
        return 'Good'

print(renzoku(S))

Submission status: Accepted

Solution code:
S = input()

prev = None
flag = False
for i in range(len(S)):
    if prev == S[i]:
        flag = True
        break
    prev = S[i]

if flag:
    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 = 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:
S=input()
print("Bad" if any(S[i]==S[i+1] for i in range(3)) else "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:
import sys
S = input()
for i in range(len(S)-1):
  if S[i] == S[i+1]:
    print("Bad")
    sys.exit(0)
print("Good")

Submission status: Accepted

Solution code:
s = input()
before = ""
flag = 0
for i in s:
    if before == i:
        flag = 1
    before = i
if flag == 1:
    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 sys

s = sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

Solution code:
s=input()
out=0

if s[0]!=s[1]:
    if s[1]!=s[2]:
        if s[2]!=s[3]:
            out=1
if out==1:
    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:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc131/tasks/abc131_a

s = input()
print("Bad") if s[0] == s[1] or s[1] == s[2] or s[2] == s[3] 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')
        break
    else:
        cnt+=1
if cnt==3:
    print('Good')

Submission status: Accepted

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

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

if cnt != 0:
	print('Bad')
else:
	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()

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

from itertools import groupby
gr = groupby(list(s))

for k, g in gr:
    if len(list(g)) >= 2:
        print('Bad')
        break
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, j in enumerate(s):
    if i<len(s)-1 and s[i+1]==j:
        print("Bad")
        exit(0)
print("Good")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()

flg = 1
for i in range(len(S)-1):
  if S[i] == S[i+1]:
    print("Bad")
    flg = 0
    break
if flg:
  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"
        break
print(ans)

Submission status: Accepted

Solution code:
def main():
    a=input()
    ca=a[0]
    for c in a[1:]:
        if ca == c:
            print('Bad')
            return
        ca = c
    print('Good')

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
import numpy as np
from sys import stdin
from copy import deepcopy
from functools import reduce
from fractions import gcd
import math
import itertools
from collections import Counter
from itertools import chain  ##list(chain.from_iterable(l)) ##flatten
from heapq import heappush, heappop

"""
N = int(input())
A, B = map(int,input().split())
A = list(map(int,input().split())) ## 横一列
A = [int(input()) for _ in range(N)] ## 縦一列
lst = [list(map(int,input().split())) for i in range(M)] ## 二次元
"""

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

Submission status: Accepted

Solution code:
ls = list(input())
flg = False
for i in range(len(ls)-1):
    if ls[i] == ls[i+1]:
        flg=True

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

Submission status: Accepted

Solution code:
n=input()
ans='Good'
for i in range(1,len(n)):
  if n[i]==n[i-1]:
    ans='Bad'
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
buffer = S[0]

ans = "Good"

for i in range(1,len(S)):
    #print(S[i])
    if buffer == S[i]:
        ans = "Bad"
        break

    buffer = S[i]

print(ans)

Submission status: Accepted

Solution code:
s = input()

ans = 'Good'
c1 = ''
for c2 in s:
  if c1 == c2:
    ans = 'Bad'
    break
  c1 = c2
  
print(ans)

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=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())
count = 0
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        count += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


def main():
    S = list(input())
    print('Good' if all([S[0] != S[1], S[1] != S[2], S[2] != S[3]]) else 'Bad')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S=input()
for i in range(len(S)-1):
    if S[i]==S[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")
else:
    print('Good')

Submission status: Accepted

Solution code:
S = list(input())
S = [int(i) for i in S]
t = 0
for i in range(3):
  if S[i] == S[i+1]:
    t += 1
  else:
    continue
if t == 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()
for i in range(len(S) - 1):
    if (S[i] == S[i + 1]):
        print('Bad')
        exit(0)
print('Good')

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:
N = input()
count = 0
for i in range(len(N) - 1):
  if N[i] == N[i + 1]:
    count += 1
if count >= 1:
  print('Bad')
else:
  print('Good')

Submission status: Accepted

Solution code:
S = input()

prev = ""
bad = False
for i in range(4):
  if prev == S[i]:
    bad = True
    break
  prev = S[i]
  
if bad:
  print("Bad")
else:
  print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())
Vincent = True
for i in range(len(S) - 1):
    if S[i] == S[i + 1]:
        Vincent = False
        break
if Vincent:
    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] and S[1]!=S[2]and S[2]!=S[3]:
    print("Good")
else:
    print("Bad")

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

Submission status: Accepted

Solution code:
s = input()
l = [s for s,t in zip(s,s[1:]) if s==t]
print('Bad' if len(l) else '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(str(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=list(input())
print('Good' if s[0] != s[1] and s[1] != s[2] and s[2] !=s[3] else '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:
#131 a
s=input()
ans=True
for i in range(len(s)-1):
    if s[i]==s[i+1]:
        ans=False
        break
print("Good" if ans else "Bad")

Submission status: Accepted

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

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 sys
row = sys.stdin.readline
 
ls = list(row())
s = sum([1 for i in range(1, len(ls)) if ls[i-1] != ls[i]])
print("Good" if s+1 == len(ls) else "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 = list(input())
for i in range(1,4):
    if s[i-1] == s[i]:
        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:
import sys

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

Submission status: Accepted

Solution code:
S =list(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] == S[i-1]:
      print('Bad')
      exit()
      
print('Good')

Submission status: Accepted

Solution code:
s = "Good"
c = '_'
for c2 in input():
  if c == c2:
    s = "Bad"
  c = c2
print(s)

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

flg = False
for index in range(len(S)):
    if index != 0:
        mae = S[index-1]
        value = S[index]
        if mae == value:
            print("Bad")
            flg = True
            break
if flg == False:
    print("Good")

Submission status: Accepted

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

else:
    print("Bad")

Submission status: Accepted

Solution code:
S = input()

evalation = "Good"
for i in range(len(S)):
    try:
        if S[i] == S[i + 1]:
            evalation = "Bad"
    except:
        pass

print(evalation)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    s = input()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()

flag=True

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

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

Submission status: Accepted

Solution code:
def main():
  s = input()
  for s1, s2 in zip(s[:-1], s[1:]):
    if s1==s2:
      return 'Bad'
  return 'Good'

if __name__ == '__main__':
  print(main())

Submission status: Accepted

Solution code:
s = input()

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

print( input_type )

Submission status: Accepted

Solution code:
S = input()

flag = 0;

for i in range(1, 4):
    if S[i-1] == S[i] :
        flag = 1

res = "Good" if flag==0 else "Bad"

print(res)

Submission status: Accepted

Solution code:
S = list(map(int, 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:
c = None
for i in list(input()):
    if c == i:
        print('Bad')
        break
    else: c = i
else: print('Good')

Submission status: Accepted

Solution code:
S = input()
before = S[0]

for s in S[1:]:
  if s == before:
    print('Bad')
    exit(0)
  before = s
  
print('Good')

Submission status: Accepted

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

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



if __name__=="__main__":
    main()

Submission status: Accepted

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

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:
        continue
else:
    print('Good')

Submission status: Accepted

Solution code:
import sys

S = input()

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

print('Good')

Submission status: Accepted

Solution code:
s = list(int(s) for s in input())

for i in range(0, 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]:
  r = 'Bad'
else:
  r = 'Good'
 
print(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
li = [int(i) for i in list(input())]
#print(li)
for i in range(len(li)-1):
    if li[i] == li[i+1]:
        print("Bad")
        break
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:
s=input()

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 12, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

a, b, c, d = readline().decode('utf8').rstrip()
print('Bad' if a == b or b == c or c == d else '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()

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

Submission status: Accepted

Solution code:
S=input()

ans="Good"
for i in range(1,4):
    if S[i]==S[i-1]:
        ans="Bad"
print(ans)

Submission status: Accepted

Solution code:
S = list(input())
prev = S[0]
ans = True
for i in range(1, 4):
    if S[i] == prev:
        ans = False
    prev = S[i]
print("Good" if ans else "Bad")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


class AtCoder:
    def main(self):
        S = input().rstrip()

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


# Run main
if __name__ == '__main__':
    AtCoder().main()

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

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

print("Good")

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import numpy as np
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

s = ns()

for i in range(1,4):
    if s[i-1] == s[i]:
        print("Bad")
        quit()
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()
a=(str(S)[0])
b=(str(S)[1])
c=(str(S)[2])
d=(str(S)[3])
if(int(a)==int(b)):
  print("Bad")
elif(int(b)==int(c)):
  print("Bad")
elif(int(c)==int(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 = input()

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

Submission status: Accepted

Solution code:
s = input()

pre_s_i = ''

ans = 'Good'

for s_i in s:
  if pre_s_i == s_i:
    ans = 'Bad'
    break
  
  pre_s_i = s_i
  
print(ans)

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    s=STR()
    frag=1
    for i in range(3):
        if s[i]==s[i+1]:
            frag=0
    if frag==1:
        print('Good')
    else:
        print('Bad')
if __name__ == '__main__':
    do()

Submission status: Accepted

Solution code:
S = list(input())

S1 = S[0]
count = 0
for i in range(1,4):
  if S1 != S[i]:
    count += 1
    S1 = S[i]
if count == 3:
  print("Good")
else:
  print("Bad")

Submission status: Accepted

Solution code:
def is_secure(S):
    for i in range(len(S)-1):
        if S[i] == S[i+1]:
            return 'Bad'
    return 'Good'


print(is_secure(input()))

Submission status: Accepted

Solution code:
S = list(input())

for i, x in enumerate(S):
    if i == len(S)-1:
        print('Good')
        break
    elif S[i] == S[i+1]:
        print('Bad')
        break
    else:
        pass

Submission status: Accepted

Solution code:
from sys import stdin


def fetch_one_line():
    return stdin.readline().rstrip()


def fetch_int_input():
    return [int(s) for s in fetch_one_line().split()]


def fetch_inputs(times):
    return [fetch_one_line() for _ in range(times)]

def fetch_int_inputs(times):
    return [[int(s) for s in fetch_one_line()] for _ in range(times)]

def fetch_ints_inputs(times):
    return [fetch_int_input() for _ in range(times)]



nums = fetch_one_line()
tmp = ""

flag = True
for n in nums:
    if tmp == n:
        flag = False
        break
    tmp = n

answer = ["Bad", "Good"]
print(answer[int(flag)])

Submission status: Accepted

Solution code:
s = input()
ans=0

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

Submission status: Accepted

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

Submission status: Accepted

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