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:
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = list(iss())
    print('Good' if N[0] != N[1] != N[2] != N[3] else 'Bad')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC 131: A – Security
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()
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]==S[i+1]:
    flag=1

if flag==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:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  s = input()
  ans = 'Good'
  for i in range(3):
    if s[i]==s[i+1]:
      ans ='Bad'
  print(ans)
  
  
  
  
  
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
s = input()
for i in range(4):
    if s[i] == s[i-1] and i is not 0:
        print('Bad')
        break
    elif i == 3:
        print('Good')
    else:
        continue

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
import itertools
import fractions
def main():
  s = input()
  for i in range(0,3):
    if s[i] == s[i + 1]:
      print('Bad')
      exit()
  print('Good')
  
if __name__ == '__main__':
  main()

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()
x = 0

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

if x == 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 = list(input())
flag = 0
for i in range(3):
    if S[i+1] == S[i]:
        flag = 1
        break
if flag == 0:
    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")
    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=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()

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

Submission status: Accepted

Solution code:
#4桁
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(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(1,4):
    if s[i-1] == s[i]:
        c += 1

if c != 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:
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B, C, D = list(iss())
    print('Bad' if A == B or B == C or C == D else 'Good')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
S = input()
print('Good' if all(c1 != c2 for c1, c2 in zip(S, S[1:])) 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 = input()
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        print ("Bad")
        exit ()
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 = list(input())
for i in range(3):
    if s[i] == s[i+1]:
        break
else:
    print('Good')
    exit()
print('Bad')

Submission status: Accepted

Solution code:

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

if flag==0:
  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'
print(ans)

Submission status: Accepted

Solution code:
S = input()

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

print(ans)

Submission status: Accepted

Solution code:
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:
#!/usr/bin/env python3
import sys


def solve(S: int):
    prev = S[0]
    for i in range(1,len(S)):
        if prev == S[i]:
            print("Bad")
            exit()
            break
        else:
            prev = S[i]
    print("Good")
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: int
    solve(S)

if __name__ == '__main__':
    main()

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

i = 0
ans = 'Good'
while i < 3:
    if S[i] == S[i+1]:
        ans = 'Bad'
    i +=1
print(ans)

Submission status: Accepted

Solution code:
import sys

S = list(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=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()
pre = ''
r = 'Good'
for c in s:
    if c == pre:
        r = 'Bad'
        break

    pre = c

print(r)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
n = len(S)

answer = 0
for i in range(n - 1):
    if S[i] == S[i + 1] :
        answer = 1
        
if answer == 1:
	print("Bad")
else:
	print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
# from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# import scipy as scp

# 入力の受け取り
s = input()

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

print(ans)
# print("{:.10f}".format(ans))
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する

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

Submission status: Accepted

Solution code:
num = input()
dummy = ""
flag = "Good"
for i in num:
  if dummy == i:
    flag = "Bad"
    break
  dummy = i
print(flag)

Submission status: Accepted

Solution code:
# A
import sys
s = input()
pre = ''
for c in s:
    if c == pre:
        print('Bad')
        sys.exit()
    pre = c
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

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=input();print(['Bad','Good'][a!=b!=c!=d])

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

a,b,c,d = input().rstrip("\r\n")
ans = "Bad" if a==b or b==c or c==d else "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:
a = input()
b = [a[i] for i in range(4)]
ans = ''
for i in range(0,3):
    if b[i] == b[i+1]:
        ans = 'Bad'
if ans == '':
    ans = 'Good'
print(ans)

Submission status: Accepted

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

ans = 'Good'

for i in range(1, 4):
    after = s[i]
    if before==after:
        ans = 'Bad'
    before = after

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

flag = False
for l1, l2 in zip(lis[:-1], lis[1:]):
  if l1==l2:
    flag = True
    
if flag:
  print("Bad")
else:
  print("Good")

Submission status: Accepted

Solution code:
s = input()

print("Good" if all([s[i] != s[i-1] for i in range(1, len(s))]) else "Bad")

Submission status: Accepted

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

print(solve())

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()
c = 'a'

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

Submission status: Accepted

Solution code:
n = list(map(int, list(input())))
i = -1
ans = "Good"
for i1 in n:
    if i == i1:
        ans = "Bad"
        break
    else:
        i = i1 + 0
print(ans)

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = sr()
bl = True
for x, y in zip(S[:], S[1:]):
    if x == y:
        bl = False

print('Good' if bl else 'Bad')
#

Submission status: Accepted

Solution code:
s = input()
ans =''

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

Submission status: Accepted

Solution code:
from itertools import groupby
print("Bad" if len(list(groupby(input()))) < 4 else "Good")

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

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

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

Submission status: Accepted

Solution code:
S = input()
prev_si = ''
flag = False
for si in S:
    #print(prev_si, si)
    if si == prev_si:
        #print('Bad')
        flag = True
    prev_si = si

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

Submission status: Accepted

Solution code:
# ABC131 A

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

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

Submission status: Accepted

Solution code:
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

S = input()
print('Good' if all(i != j for i, j in zip(S, S[1:])) else '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:
# coding: utf-8

def is_easy(pwd:str):
    for i in range(1, len(pwd)):
        if pwd[i-1] == pwd[i]:
            return False
    return True


print("Good" if is_easy(input().rstrip()) else "Bad")

Submission status: Accepted

Solution code:
s = str(input())
for i in range(1 , 4) :
    if s[i] == s[i - 1] :
        print('Bad')
        quit()
else :
    print('Good')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

flg = 0

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
ans = 'Good'
last = ''

for c in S:
    if c == last:
        ans = 'Bad'
    last = c
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=input()
x=list(x)
t=0
for i in range(len(x)-1):
	if x[i]==x[i+1]:
		t=1
if t==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:
from collections import Counter

def main():
    s = input()
    src = ""
    for dst in s:
        if dst == src:
            print("Bad")
            break
        src = dst
    else:
        print("Good")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    s = list(map(int, list(input())))
    for i in range(len(s)-1):
        if s[i] == s[i+1]:
            print("Bad")
            import sys; sys.exit(0)
    print("Good")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = 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:
# Problem A - Security

# input process
S = input()
S_len = len(S)

# initialization
is_ok = True

# count process
for i in range(S_len-1):
    if S[i]==S[i+1]:
        is_ok = False
        break

# output process
if is_ok:
    print("Good")
else:
    print("Bad")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
S = [i for i in S]
ans = 0

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

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

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

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

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=input()
cnt=1
ans=1
for i in range(1, len(S)):
    if S[i] == S[i-1]:
        cnt +=1
        if ans<cnt:
            ans=cnt
    else:
        cnt=1
if ans>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:
s = input()

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

Submission status: Accepted

Solution code:
s=input()
s1=list(s)
past=""
for s2 in s1:
    if s2==past:
        print("Bad")
        exit()
    else:
        past=s2

print("Good")

Submission status: Accepted

Solution code:
n = list(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

# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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:
a=list(input())
for i in range(len(a)-1):
	if a[i]==a[i+1]:
		print("Bad")
		break
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()
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 - Security

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

Submission status: Accepted

Solution code:
s = input()
def main():
    for i in range(len(s)):
        if i == 0:
            continue
        if s[i] == s[i-1]:
            print('Bad')
            return 0
    print('Good')
    return 0
main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin

n = stdin.readline().rstrip()
print("Good" if (n[0] != n[1]) and (
    n[1] != n[2]) and (n[2] != n[3]) else "Bad")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    s = input()

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



if __name__ == '__main__':
    main()

Submission status: Accepted

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

for x,y in enumerate(S):
    if x != len(S)-1:
        if y == S[x+1]:
            ans = "Bad"
            break
print(ans)

Submission status: Accepted

Solution code:
l = list(input())

c = 0

for i in range(len(l)-1):
  if l[i] == l[i+1]:
    c += 1

if c >= 1:
  print('Bad')
else:
  print('Good')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = list(input())

out = "Good"

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
count=1
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())
flag = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()

ans = 'Good'

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
a=0
for i in range(len(s)-1):
    if s[i]==s[i+1]:
        a+=1
    else:
        continue
if a==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')