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
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))
# map(int, input().split())
# int(input())
# input().split()
# mojiretu = ','.join(str_list)
# sorted(input())
s = input()
t = s[0]
for i in range(1, 4):
    if t == s[i]:
        print('Bad')
        sys.exit()
    t = s[i]
print('Good')

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

Solution code:
N=input()

count=0
for i in range(-1,-4,-1):
  if N[i]==N[i-1]:
    count+=1
  else:
    count+=0
if count>=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()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    s = input()
    for i in range(1, len(s)):
        if s[i] == s[i-1]:
            print('Bad')
            exit()
    print('Good')

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
N = len(S)

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

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

Submission status: Accepted

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

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:
pre=""
for i in input():
    if i==pre:print("Bad");break
    pre=i
else:print("Good")

Submission status: Accepted

Solution code:
s = input()
count = 0
tmp = ''
for i in s:
  if tmp == '':
    tmp = i
  if tmp == i:
    count += 1
  else:
    tmp = i
if count >= 2:
  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()
if s[1]==s[2] or s[2]==s[3] or s[1]==s[0]:
    print('Bad')
else:
    print('Good')

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
S = input().rstrip()

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

print(ans)

Submission status: Accepted

Solution code:
a,b,c,d=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A
s = input()
flg = False

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

Submission status: Accepted

Solution code:
s = list(input())
# print(s)

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:
#copy

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

bool = True

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

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

Submission status: Accepted

Solution code:
def main():
    S = input()
    easy = True
    for i in range(len(S)-1):
        if S[i] == S[i+1]:
            easy = False
    if easy:
        print("Good")
    else:
        print("Bad")
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#数字でも文字列として扱える。intにすると左一桁目から0がある場合存在しないものとなるので注意
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()))
l = [a, b, c, d]

if a==b or b==c or c==d:
    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")
        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:
Ss = input().rstrip()

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

Submission status: Accepted

Solution code:
s = input()
t = s[0]
for i in range(1, len(s)):
    if s[i] == t:
        print('Bad')
        exit()
    t = s[i]

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

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

Submission status: Accepted

Solution code:
s = input()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

""" Input
N, A, B = map(int, input().split())
A = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""

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

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




# def main():

# if __name__ == '__main__':
#     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:
str=input()
if str[0]==str[1] or str[2]==str[1] or str[2]==str[3]:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

Solution code:
num = list(input())

jadge = ""

for i in range(len(num) - 1):
  if num[i] != num[i + 1]:
    jadge = "Good"
    continue
  else:
    jadge = "Bad"
    break

print(jadge)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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=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 = True
if S[0] == S[1]:
    flag = False

elif S[1] == S[2]:
    flag = False

elif S[2] == S[3]:
    flag = False

if flag:
    print('Good')

else:
    print('Bad')

Submission status: Accepted

Solution code:
s=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()
ans='Good'
if s[0]==s[1]:
    ans='Bad'
elif s[1]==s[2]:
    ans='Bad'
elif s[2]==s[3]:
    ans='Bad'
print(ans)

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:
s = input()
c = str(s)
p = 0
for i in c:
    if c[p] == c[p+1]:
        print('Bad')
        break
    if p == 2:
        print('Good')
        break
    p = p + 1

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = list(input())
f = True

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

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

Submission status: Accepted

Solution code:
#--Security

code = list(input())

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

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, groupby
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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()
w = ''
ans = 'Good'

for a in S:
    if w == a:
        ans = 'Bad'
    w = a

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
ans = "Good"
mae = "A"
for s in S:
    if s == mae:
        ans ="Bad"
    mae = s
    
print(ans)

Submission status: Accepted

Solution code:
import sys
import os
import math
import string

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

MOD = 10 ** 9 + 7


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

    S = iss()
    print('Good' if all([S[i] != S[i+1] for i in range(len(S)-1)]) else 'Bad')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(A)

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

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

Submission status: Accepted

Solution code:
a, b, c, d = input()
count = 0
if a == b or b == c or c == d:
  count += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(input())
for i in range(3):
  if l[i] == l[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]:
        continue
    else:
        print('Bad')
        break
else:
    print('Good')

Submission status: Accepted

Solution code:
from sys import stdin
N= list(map(int,stdin.readline().strip()))
if N[0]==N[1] or N[1]==N[2] or N[2]==N[3]:
    print("Bad")
else:print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def pas():
    s = input()
    for i in range(len(s)-1):
        if s[i] == s[i+1] and i !=len(s)-1:
            return 'Bad'
    return 'Good'
print(pas())

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

Submission status: Accepted

Solution code:
S = input()
flag = False

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

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

Submission status: Accepted

Solution code:
S = input()
A = S[0]
B = S[1]
C = S[2]
D = S[3]

if A == B or B ==C or C ==D:
  print("Bad")
else:
  print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
if s[0]==s[1] or s[1]==s[2] or s[2]==s[3]:
  print('Bad')
  exit()
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 = 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())
temp = s[0]
flag = 0
for i in range(1,4):
    if s[i] == temp:
        flag = 1
        break
    else:
        temp = s[i]
print('Bad' if flag == 1 else 'Good')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

print('Good' if a[0] != a[1] !=a[2] !=a[3]  else '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:
a = input()
flag = False

for i in range(0, 3):
    if a[i] == a[i+1]:
        print("Bad")
        flag = True
        break

if not flag:
    print("Good")

Submission status: Accepted

Solution code:
S = input()
ans = 0
if S[0] == S[1]:
  ans = 1
if S[1] == S[2]:
  ans = 1
if S[2] == S[3]:
  ans = 1
if ans == 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(len(s)-1)]) else "Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

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

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

# s = '3776'

before = s[0]
isFlg = True

for i in s[1:]:
    if before == i:
        isFlg = False

    before = i

if isFlg == False:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = 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 = str(input())
import sys
for i in range(3):
     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(3):
    if S[i] == S[i+1]:
        ans = 'Bad'
        break
print(ans)

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

Submission status: Accepted

Solution code:

s = input()

isGood = True

if s[0] == s[1]:
    isGood = False
if s[1] == s[2]:
    isGood = False
if s[2] == s[3]:
    isGood = False

if isGood:
    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 = 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()
ans=''
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()

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 numpy as np
import sys

input = sys.stdin.readline

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

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")


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())
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 = input()
if (a==b)or(b==c)or(c==d):
    print("Bad")
else : print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=input()
print("Bad" if a==b or b==c or c==d else "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()

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

Submission status: Accepted

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
S = list(str(input()))
#print(S)
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().rstrip()
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()

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

answer = 'Good'
for i in range(len(S) - 1):
    current = S[i]
    right = S[i + 1]
    is_continuous_numbers = current is right
    if is_continuous_numbers:
        answer = 'Bad'
        break

print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def PL(L) : print(*L, sep="\n")

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

Submission status: Accepted

Solution code:
A=list(map(int,input()))
if A[0]!=A[1] and A[1]!=A[2] and A[2]!=A[3]:
    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(0)
    
print("Good")

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    q1()

Submission status: Accepted

Solution code:
s = input()
out = 'Good'
for i, s_ in enumerate(s[1:]):
    if s[i]==s_:
        out = 'Bad'
print(out)

Submission status: Accepted

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