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

Submission status: Accepted

Solution code:
# 初期入力
import sys
input = sys.stdin.readline
S =input().strip()
for i in range(len(S)-1):
    if S[i] ==S[i+1]:
        print("Bad")
        exit()
print("Good")

Submission status: Accepted

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

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

def is_good(code):
  if code[0] == code[1] or code[1] == code[2] or code[2] == code[3]:
    return False
  return True

if is_good(S):
  print('Good')
else:
  print('Bad')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input()
print("Bad" if any(n[i]==n[i-1] for i in range(1,4)) else "Good")

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
#import numpy as np
INF = float("inf")
#d = defaultdict(int)
#d = defaultdict(list)
#N = int(input())
#A = list(map(int,input().split()))
#S = list(input())[:-1]
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = [int(input()) for _ in range(N)]
#S = [list(input())[:-1] for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
n = int(input())
a = n % 10
n //= 10
b = n % 10
n //= 10
c = n % 10
n //= 10
d = n % 10
if a == b or b == c or c == d:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

Solution code:
s=list()
s=input()
result=0

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

Submission status: Accepted

Solution code:
password = input()
x = list(password)
if int(x[0])-int(x[1]) == 0 \
    or int(x[1])-int(x[2]) == 0 \
    or int(x[2])-int(x[3]) == 0 :
    print("Bad")
else : print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = input()
for i in range(3):
    if s[i] == s[i+1]:
        print("Bad")
        s = 0
        break
if s != 0:
    print("Good")

Submission status: Accepted

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

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

for c in s:
    if pre == c:
        print('Bad')
        exit()
    pre = c

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()
print('Good' if all(si != sj for si, sj in zip(s, s[1:])) else 'Bad')

Submission status: Accepted

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

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()
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()
s_prev = ""
for s_i in s:
    if s_i == s_prev:
        print('Bad')
        exit()
    s_prev = s_i
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:
a, b, c, d = input()
print('Good' if a != b != c != d else 'Bad')

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    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')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

pre = ""
for s in S:
    if pre == s:
        print("Bad")
        exit()
    pre = s

print("Good")

Submission status: Accepted

Solution code:
s = str(input())

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

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

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

print("Good")

Submission status: Accepted

Solution code:
x = list(input())
if x[0] != x[1] and x[1] != x[2] and x[2] != x[3]:
    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:
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()
for i in range(3):
  if s[i] == s[i+1]:
    print('Bad')
    exit()
    
print('Good')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

s = list(str(input()))

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

Submission status: Accepted

Solution code:
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from fractions import gcd
from math import ceil, floor, sqrt
from copy import deepcopy

def main():
   s = input()
   flag = True
   for i,v in enumerate(s):
      if i != 0:
         if s[i-1] == v:
            flag = False
            break
   if flag:
      print("Good")
   else:
      print("Bad")

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]):
  print('Bad')
elif(s[1] == s[2]):
  print('Bad')
elif(s[2] == s[3]):
  print('Bad')
else:
  print('Good')

Submission status: Accepted

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

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()
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] 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()
result = [True if S[i-1] != S[i] else False for i in range(1, len(S))]
print('Good' if all(result) else 'Bad')

Submission status: Accepted

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

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()
n = ""
for i in s:
    if n == i:
        print("Bad")
        exit(0)
    n = i
print("Good")

Submission status: Accepted

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

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=list(input())
before=0
flag=1
for i in s:
    if i==before:
        flag-=1
    else:
        before=i
if flag<1:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

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

Submission status: Accepted

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

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

if fl is True:
    print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools


def resolve():
    S = input()
    group = itertools.groupby(S)

    if len(S) != len(list(group)):
        print('Bad')
        return

    print('Good')


resolve()

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

Submission status: Accepted

Solution code:
from collections import Counter 
from collections import defaultdict
from collections import deque
import math
import itertools
import heapq
import numpy as np
import sys
sys.setrecursionlimit(10**6)

#n=int(input())
#n,m=list(map(int,input().split()))
#a=list(map(int,input().split()))
input_list = lambda : list(map(int,input().split()))


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:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
s = S()
ans = 'Good'
tmp = ''
for c in s:
    if tmp == c:
        ans = 'Bad'
    tmp = c
print(ans)

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
import 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()
s = list(S)
p = 1
for i in range(3):
    if s[i] == s[i+1]:
        p = 0
        print('Bad')
        break
if p == 1:
    print('Good')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(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()
a=99
ans=True
for i in range(len(s)):
    if s[i]==a:
        ans=False
        break
    a=s[i]
    
if ans==True:
    print("Good")
else:
    print("Bad")

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
def security(s):

    return "Good" if s[0] != s[1] and s[1] != s[2] and s[2] != s[3] else "Bad"
def main():
    s = list(str(input()))
    print(security(s))

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

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    s = input()
    ans = True
    for i in range(1, len(s)):
        if s[i] == s[i-1]:
            ans = False
    if ans:
        print('Good')
    else:
        print('Bad')
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S = input()

if (S[0]==S[1]) or  (S[2]==S[1]) or  (S[2]==S[3]):
  print("Bad")
  exit()
  
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()
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()

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

Submission status: Accepted

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

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:
n=str(input())
n=list(n)
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:
def ABC_131_A():
    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__':

    ABC_131_A()

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

Submission status: Accepted

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


solve()

Submission status: Accepted

Solution code:
import sys
S = list(input().rstrip())

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

print("Good")

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
#from fractions import gcd
#from math import gcd
import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


s = 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:

a, b, c, d = input()

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

Submission status: Accepted

Solution code:
s = input()
for i in range(len(s)):
    if i < len(s)-1 and s[i] == s[i+1]:
        print('Bad'); break
else:
    print('Good')

Submission status: Accepted

Solution code:
li = list(input())
ma = 0
tr = 0

for i,l in enumerate(li,1):
  if i==1:
    ma = l
  else:
    tr = l
    if ma==tr:
      print('Bad')
      break
    ma = l
  if i==4:
    print('Good')
    break

Submission status: Accepted

Solution code:
# ABC131A

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(1,4):
  if S[i]==S[i-1]:
    print('Bad')
    exit(0)
print('Good')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Security

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# region header
import sys
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos, pi, e
from operator import itemgetter
sys.setrecursionlimit(10**6)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
# endregion
S = rs()
N = len(S)
if N > 1:
    for i in range(N - 1):
        if S[i] == S[i + 1]:
            print('Bad')
            exit()
print('Good')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
pr = 'X'
ans = 'Good'
for s in S:
    if pr == s:
        ans = 'Bad'
        break
    pr = s
print(ans)

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# N = int(input())
S = input()
# N, A, B = map(int, input().split())
# A = list(map(int, input().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=raw_input()
prev=None
for x in S:
    if prev==x:
        print "Bad"
        quit()
    prev=x
else:
    print "Good"

Submission status: Accepted

Solution code:
s = list(input())

p = ''
for i in s:
    if p == i:
        print('Bad')
        exit()
    else:
        p = i
print('Good')

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
s = input()
s_o = 10
flag = "ok"
for i in s:
    if s_o == i:
        flag = "ng"
    s_o = i
if flag == "ng":
    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();print("GBoaodd"[s[0]==s[1]or s[1]==s[2]or s[2]==s[3]::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
p = input()
for i in range(len(p)-1):
  if p[i] == p[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 = list(str(input()))
if S[0] == S[1]:
    print('Bad')
elif S[1] == S[2]:
    print('Bad')
elif S[2] == S[3]:
    print('Bad')
else:
    print('Good')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

S = input()
S_set = set(S)

for i in S_set:
    j = i + i
    if j in S:
        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")
    quit()

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:
password = input()
i = 0
answer = 'Good'
while i < 3:
    if password[i] == password[i+1]:
        answer = 'Bad'
        break
    else:
        i += 1
print(answer)

Submission status: Accepted

Solution code:
import numpy as np
import sys
import math

S=input()
s=S[0]
for i in range(len(S)-1):
    if S[i+1]==s:
        print('Bad')
        sys.exit()
    s=S[i+1]
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:
# ABC 131
S=str(input())
for i in range(1,len(S)):
    if S[i]==S[i-1]:
        ans ="Bad"
        break
    else:
        ans ="Good"
print(ans)

Submission status: Accepted

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

print('Good')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    S = list(input())

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


main()

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:
# ABC131 A - Security
tmp = ''
rt = 'Good'
for x in input():
    if x != tmp:
        tmp = x
    else:
        rt = 'Bad'
        break
print(rt)

Submission status: Accepted

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

Submission status: Accepted

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