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
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations,product#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reverse=True)  #二個目の要素で降順並び替え

    #N = int(input())
    #N, K = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
    s=input()
    for i in range(1,4):
        if s[i]==s[i-1]:
            print('Bad')
            return
    print('Good')




if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s=list(str(input()))
f=True
for i in range(1,4):
	if s[i-1]==s[i]:
		f=False
		break
	else:
		continue
if f:
	print("Good")
else:
	print("Bad")

Submission status: Accepted

Solution code:
S = input()
flag = False
for s in S:
  if flag:
    if temp == s:
      print("Bad")
      quit()
  temp = s
  flag = True
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:
line = list(input())
if line[0] != line[1]:
    if line[1] != line[2]:
        if line[2] != line[3]:
            print("Good")
        else:
            print("Bad")
    else:
        print("Bad")
else:
    print("Bad")

Submission status: Accepted

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

if lis[0] == lis[1] or lis[1] == lis[2] or lis[2] == lis[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()

flag = 1
for i in range(len(S)-1):
  if S[i] == S[i+1]:
    flag = 0
    break
if flag == 0:
  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()
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 math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0

S = X()

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

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

Submission status: Accepted

Solution code:
from itertools import groupby
import sys
rr = lambda: sys.stdin.readline().rstrip()

print('Good' if len(list(groupby(rr()))) == 4 else '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:
# n, k = map(int, input().split())
# n = int(input())
# li = list(map(int, input().split()))
s = input()
flag = True
prev = ''
for i in s:
	if i == prev:
		flag = False
		break
	prev= i
print("Good" if flag else "Bad")

Submission status: Accepted

Solution code:
ss=input().strip()
flg=False
for i in range(1,len(ss)):
  if ss[i]==ss[i-1]:
    flg=True
    
if flg==True:
  print("Bad")
else:
  print("Good")

Submission status: Accepted

Solution code:
x=input()
b=x[0]
for i in x[1:]:
  if b==i:
    print("Bad")
    break
  b=i
else:
  print("Good")

Submission status: Accepted

Solution code:
from itertools import groupby
import sys
rr = lambda: sys.stdin.readline().rstrip()
s = rr()
print('Good' if len(list(groupby(s))) == 4 else 'Bad')

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:
def main():
    a=input()
    for i in range(1,len(a)):
        if(a[i]==a[i-1]):
            print("Bad")
            return;
    print("Good")

main()

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:
import sys
input = lambda: sys.stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
s = list(input())
i = 0
answer = "Good"

while i < 3:
  if s[i] == s[i + 1]:
    answer = "Bad"
  i += 1
print(answer)

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

Submission status: Accepted

Solution code:
a = list(map(int, input()))
if a[0] == a[1]:
    print("Bad")
elif a[1] == a[2]:
    print("Bad")
elif a[2] == a[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()

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

i = 0

if key[i] == key[i+1] or key[i+1] == key[i+2] or key[i+2] == key[i+3]:
  print('Bad')
else :
  print('Good')

Submission status: Accepted

Solution code:
s = input()

for i, j in zip(s, s[1:]):
  if i == j:
    print("Bad")
    break
else:
  print("Good")

Submission status: Accepted

Solution code:
S = str(input())

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

if judge == "Bad":
    print("Bad")
else:
    print("Good")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = 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
for T in range(0,3):
    if S[T]==S[T+1]:
        Flag = False
        break
if Flag:
    print('Good')
else:
    print('Bad')

Submission status: Accepted

Solution code:
s = input()
bad = 0
for i in range(1, len(s)):
    if s[i] == s[i-1]:
        bad = 1
        break

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
s = input()
r = 'Bad'
if s[0] != s[1] and s[1] != s[2] and s[2] != s[3]:
  r = 'Good'
print(r)

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:
#!/usr/bin/env python3
s=input()
print('GBoaodd'[any(s[i-1]==s[i]for i in range(1,len(s)))::2])

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
  
i = 0
while i < len(S)-1:
  if S[i] == S[i+1]:
    print("Bad")
    break
  i += 1
else:
  print("Good")

Submission status: Accepted

Solution code:
print('Good'*eval('!='.join(input()))or'Bad')

Submission status: Accepted

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

Submission status: Accepted

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

ans=1

for i in range(3):
    if arr[i]==arr[i+1]:
        ans*=0
    
if ans==0:
    print("Bad")
else:
    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] 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:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
S = input()
prev = None
for s in S:
    if s == prev:
        print('Bad')
        break
    prev = s
else:
    print('Good')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,t,u,v=input()
print('Bad' if s==t or t==u or u==v else '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()

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("")
isgood = True
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
  isgood = False
if(isgood):
  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 = list(input())
A = 0
for i in range(0, 3) :
  if S[i] == S[i + 1] :
    A = 1
  
if A == 0 :
  print("Good")
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:
inp = list(input())
hard = 0
for number in range(0, 3) :
  if inp[number] == inp[number + 1] :
    hard = 1
    
if hard == 0 :
  print("Good")
else :
  print("Bad")

Submission status: Accepted

Solution code:
S = input()
LS = list(S)

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

Submission status: Accepted

Solution code:
nb = [int(x) for x in input()]
def solo(nb):
  for loop in range(3):
    if nb[loop] == nb[loop+1]:
      return ("Bad")
  return "Good"
print(solo(nb))

Submission status: Accepted

Solution code:
s,c,sa=input(),0,False
while c<len(s):
  if c>0 and s[c-1]==s[c]:
    sa=True
  c+=1
print("Bad" if sa else "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, b, c, d = input()
print("Good" if a != b != c != d else "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()
import sys
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()
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:
passw = input()
if passw[0] == passw[1] or passw[1] == passw[2] or passw[2] == passw[3]: print("Bad")
else: print("Good")

Submission status: Accepted

Solution code:
s=int(input())
m=10
ans=0
for i in range(0,4):
  n=s%10
  if m==n:
    print("Bad")
    ans+=1
    break;
  m=n
  s//=10
if ans==0:
  print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def split(word): 
    return [char for char in word]  
inp=input()
list=split(inp)
count=0
x=1
str="Good"
for i in range(3):
    if list[count]==list[count+1]:
        str="Bad"
    count=count+1
print(str)

Submission status: Accepted

Solution code:
# 131 A

s = input()
cnd = True

for i in range(0, len(s)-1):
    # print(i)
    if int(s[i]) == int(s[i+1]):
        cnd = False
        break

if cnd == True:
    print("Good")
else:
    print("Bad")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
i=[]
i.extend(S)
if i[0]==i[1]:
        print('Bad')
elif i[1]==i[2]:
        print('Bad')
elif i[2]==i[3]:
        print('Bad')
else:
    print('Good')

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    S = readline().strip()
    
    bad = False
    for i in range(3):
        if S[i] == S[i+1]:
            bad = True
            break
            
    if bad:
        print('Bad')
    else:
        print('Good')
    
    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
flg = True
S = input()

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

print("Good" if flg else "Bad")

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()
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:i+2].count(S[i]) == 2:
        print('Bad')
        break
else:
    print('Good')

Submission status: Accepted

Solution code:
S = input()

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

print(answer)

Submission status: Accepted

Solution code:
import sys
a=sys.stdin.readline()
b=list(a)
A,B,C,D = [int(b[i]) for i in (0,1,2,3)]
if A==B or B==C or C==D:
    print("Bad")
else:
    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:
  print("Bad")
else:
  print("Good")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)

s = input()

ch_prev = ''
for ch in s:
    if ch_prev and ch == ch_prev:
        print('Bad')
        break
    else:
        ch_prev = ch
else:
    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')


if __name__ == '__main__':
    solve()

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:
x = input()
for i in range(1,len(x)):
    if x[i-1] == x[i]:
        print("Bad")
        break
    if i == len(x)-1:
        print("Good")
        break

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:
def main():
	s = input()
	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()
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:
x = input()
z = 1
y = x[0]
for i in x[1:]:
      if (y == i):
            print("Bad")
            z = 0
            break
      y = i
if (z!= 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]:
		return "Bad"
	return "Good"
		
		
if __name__ == "__main__":
	print(solve())

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:
pwd = input()
before = ""
for s in pwd:
    if before == s:
        print("Bad")
        break
    before = s
else:
    print("Good")

Submission status: Accepted

Solution code:
a = input()
ans = []
for i in range(1,len(a)):
  if a[i-1] == a[i]:
    ans.append(False)
  else:
    ans.append(True)
if False in ans:
  print('Bad')
else:
  print('Good')

Submission status: Accepted

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

pre = ""
for x in s:
    if(x==pre):
        print('Bad')
        exit()
    pre = x
print('Good')

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
if all(s[i] != s[i+1] for i in range(3)):
    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()

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

Submission status: Accepted

Solution code:
A,B,C,D=input()
if A!=B!=C!=D:
  print("Good")
else:
  print("Bad")

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

Submission status: Accepted

Solution code:
def main():
    s = list(input())
    f = s[0]
    for i in range(1, len(s)):
        if f == s[i]:
            print('Bad')
            break
        f = s[i]
    else:
        print('Good')

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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


def solve():

    S = input()

    ans = 'Good'
    for i in range(len(S)-1):
        if S[i] == S[i+1]:
            ans = 'Bad'
    print(ans)
if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N = list(input())
    flag = True 
    for i in range(len(N)-1):
        if N[i] == N[i+1]:
            flag = False
    
    if flag:
        print("Good")
    else:
        print("Bad")

if __name__ == '__main__':
    main()

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

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:
def main():
    s = input()
    before = ''
    for v in s:
        if before == v:
            print('Bad')
            exit()
        before = v
    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 = list(input())
ans = 1
for i in range(4-1):
    if s[i] == s[i+1]:
        ans = 0
print(["Bad","Good"][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 = raw_input()
def f(s):
	for u,v in zip(s,s[1:]):
		if u == v:return 'Bad'
	return 'Good'
print f(s)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
def ip():return int(input())
def inp():return map(int,input().split())
def linp():return list(map(int,input().split()))

n=int(input())
g=n%10
s=n//10%10
b=n//100%10
q=n//1000%10
if g==s or s==b or b==q:print("Bad")
else:print("Good")

Submission status: Accepted

Solution code:
import math
def ip():return int(input())
def inp():return map(int,input().split())
def linp():return list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    s = list(input()[:-1].decode())
    if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
        print('Bad')
    else:
        print('Good')


if __name__ == "__main__":
    setrecursionlimit(10000)
    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 = list(input())

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

Submission status: Accepted

Solution code:
s = input()

tmp = ""
for i in s:
    if tmp == i:
        print("Bad")
        exit()
    else:
        tmp = i
        
print("Good")

Submission status: Accepted

Solution code:
def main():
    S = input()
    t = 'a'
    for c in S:
        if t == c:
            return False
        t = c
    return True
if main():
    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()
t = [i for i in s]

for i in range(3):
  if t[i] == t[i+1]:
    ck = False
    break
else:
  ck = True

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