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

Submission status: Accepted

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

for i in range(1, 4):
    if s[i] == s[i-1]:
        bad = 1

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

Submission status: Accepted

Solution code:
s = str(input())

l = []
for x in s:
    l += [x]

truf = True
for x in range(3):
    if l[x] == l[x+1]:
        truf = False

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

Submission status: Accepted

Solution code:
S = list(input())
tmp = 'a'
flag = False
for i in S:
    if i == tmp:
        flag = True
    tmp = i
if flag == True:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
N = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]


    token = lines[0].split()
    s = token[0]

    return (s,)


def solve(s):

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




def main():
    # 出力

    print("%s" % solve(*parse_input()))

if __name__ == '__main__':

    main()

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

curL = s[0]
f = False
for i in s[1:]:
    if i == curL:
        f = True
        break

    curL = i

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

Submission status: Accepted

Solution code:
N = input()

b = False

for i in range(0,3):
    b = b or N[i] == N[i+1]

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

Submission status: Accepted

Solution code:
def li():
    return list(map(int, input().split()))


if __name__ == "__main__":
    s = input()
    before = ""
    isBad = False
    for si in s:
        if before == si:
            isBad = True
            break
        before = si

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

Submission status: Accepted

Solution code:
from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools

INF = 10 ** 10

S = stdin.readline().rstrip()
SS = []
for x in S:
    SS.append(x)

flg = False

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

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
S = input()
b = ""
f = False
for s in S:
    if b == s:
        f = True
    b = s
if f:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

Solution code:
import numpy as np
S = input()

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

s = input()

t = ""
f = True

for i in s:
    if t == i:
        f = False
        break
    t = i

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

Submission status: Accepted

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

# In[15]:


S = list(input())


# In[17]:


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


# In[ ]:

Submission status: Accepted

Solution code:
S = input()
f = True
for i, s in enumerate(S[:-1]):
    if s == S[i+1]:
        f = False
        break
if f:
    print('Good')
else:
    print('Bad')

Submission status: Accepted

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

n = list(input())

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

Submission status: Accepted

Solution code:
S = list(input())
before=''

for s in S:
    if s == before:
        print("Bad")
        break
    else:
        before = s
else:
    print("Good")

Submission status: Accepted

Solution code:
code = list(input())
tmp = code[0]
flag = False
for c in code[1:]:
    if tmp == c:
        flag = True
        break
    else:
        tmp = c

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

#print(S)

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

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

Submission status: Accepted

Solution code:
A, B, C, D = input()

A = int(A)
B = int(B)
C = int(C)
D = int(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(len(s) - 1):
  if s[i:i+1] == s[i+1:i+2]:
    print('Bad')
    break
else:
  print('Good')

Submission status: Accepted

Solution code:
s=list(input())

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

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

Submission status: Accepted

Solution code:
import sys
S = input()
tmp = ""
for i in S:
    if tmp == i:
        print("Bad")
        sys.exit()
    tmp = i
else:
    print("Good")

Submission status: Accepted

Solution code:
code = input()
is_bad = False
for i, s in enumerate(code):
  if i > 0 and s == code[i-1]:
    print('Bad')
    is_bad = True
    break
  if i < len(s) -1 and s == code[i+1]:
    print('Bad')
    is_bad = True
    break
if not is_bad:
  print('Good')

Submission status: Accepted

Solution code:
from collections import Counter
import math
N = input()
a = N[0]
b = N[1]
c = N[2]
d = N[3]
if a == b or b==c or c==d:
	print("Bad")
else:
	print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
s = list(str(input()))
ans = 0

for ii in range(len(s)-1):
    if s[ii] == s[ii+1]:
        ans = 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
 
import sys
 
#N, M = map(int, input().rstrip().split(' '))
S = [x for x in input()]
 
for i in range(1, len(S)):
    if S[i] == S[i-1]:
        print('Bad')
        sys.exit()
        
print('Good')

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# input
a = input()

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

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

Submission status: Accepted

Solution code:
pre = 0
for i in list(input()):
    if i == pre:
        print("Bad")
        exit()
    pre = i
print("Good")

Submission status: Accepted

Solution code:
S = int(input())
s = []
GOOD = True
for i in range(4):
    s += [S%10]
    S = S//10
for i in range(3):
    if s[i] == s[i+1]:  GOOD = False

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

Submission status: Accepted

Solution code:
S = [x for x in 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:
num = input()
if num[0] == num[1] or num[1] == num[2] or num[2] == num[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 permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd


def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

    print(flag)
        
        
    

    
if __name__ == '__main__':
    main()

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

badflag = False

for i in range(3):
    if line1[i] == line1[i+1]:
        badflag = True
        break

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=input()
a=[int(i) for i in a]
j=-1
s=0
for i in a:
    if i==j:
        s=1
        break
    j=i
if s==1:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
SL = input()
SL = SL+"A"
keep = "start"
for i in SL:
    if keep == "start":
        keep = i
    elif keep == i:
        print("Bad")
        exit()
    else:
        keep = i

print("Good")

Submission status: Accepted

Solution code:
S = input()
Slist = list(S)
A = ""
for i in Slist:
    if i == A:
        print("Bad")
        break
    else:
        A = i
else:
    print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

s = input()

p = ""
for i in s:
    if i == p:
        print("Bad")
        exit()
    p = i

print("Good")

Submission status: Accepted

Solution code:
S = input()

S = [c for c in S]



tmp = S[0]

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

print("Good")

Submission status: Accepted

Solution code:
S = input()
pre_s = None
flag = False
for s in S:
    if s == pre_s:
        flag = True
        print('Bad')
        break
    pre_s = s
if not flag:
    print('Good')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
for i in range(10):
    if str(i)+ str(i) in s:
        print('Bad')
        break
    else:
        if i == 9:
            print('Good')
        pass

Submission status: Accepted

Solution code:
S = input()
if "11" in S or "22" in S or "33" in S or \
   "44" in S or "55" in S or "66" in S or \
   "77" in S or "88" in S or "99" in S or "00" in S :
    print("Bad")
else :
    print("Good")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
ans = ''
for i in s:
  if ans == i:
    print('Bad')
    exit()
  else:
    ans = i
print('Good')

Submission status: Accepted

Solution code:
a = input()
x = [a[i:i+1] for i in range(len(a))]

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S = list(map(int, input()))

for i, s in enumerate(S):
    if i == 0:
        continue
    if S[i - 1] == s:
        print('Bad')
        break
else:
    print('Good')

Submission status: Accepted

Solution code:
def A(test=None):

    if test:
        pass
    else:
        S = input()
    
    continuous = 0
    for i in range(len(S)-1):
        if S[i] == S[i+1]:
            continuous += 1
    
    if continuous > 0:
        answer = 'Bad'
    else:
        answer = 'Good'
        
    print(answer)
    

def main():
    A()


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
from collections import deque
from heapq import heappush,heappop
import re

def int_raw():
    return int(input())
 
def ss_raw():
    return input().split()
 
def ints_raw():
    return tuple(map(int, ss_raw()))


def mod_inv(a, b):
    r = a
    w = b
    u = 1
    v = 0
    while w != 0:
        t = r//w
        r -= t*w
        r, w = w, r
        u -= t*v
        u, v = v, u
    return (u % b+b) % b


DIV = 10**9+7

def ncr(n, r, mod=DIV):
	r = min(r, n-r)
	ret = 1
	for i in range(1, r+1):
		ret = ret * (n-i+1) % mod
		ret = ret * mod_inv(i, mod) % mod
	return ret
    
def mod_modify(a,mod):
    return (a+mod)%mod
    
def main():
    ans =0
    S= input()
    return "Bad" if sum([S[idx] == S[idx-1] for idx in range(1, 4)]) >= 1 else "Good"


print(main())

Submission status: Accepted

Solution code:
a = list(input())
l = len(a)
a.append("a")
ans = "Good"
for i in range(l):
    if a[i] == a[i+1]:
        ans = "Bad"
        break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

i=0
a=100
ans=0
while i!=4:
    if a==s[i]:
        ans=1
    a=s[i]
    i+=1
if ans==1:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

Solution code:
#n,y=tuple(map(int,input().split(' ')))
#N=int(input())
#x=list(map(int,input().split(' ')))

S=input()

be=S[0]

for e in list(S[1:]):
    if e==be:
        print("Bad")
        exit()
    be=e

print("Good")

Submission status: Accepted

Solution code:
import bisect
from operator import itemgetter
import math
import collections
import functools
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

s = S()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
import math

n = int(input())
#n, k = [int(i) for i in input().split()]
#table = [[int(i) for i in input().split()] for j in range(n)]
#table = [list(input()) for n in range(h)]
#list = [int(i) for i in input().split()]
#num = [int(i) for i in range(n)]
#s = input()
#list = list(s)

kotae = 0

a = int(n // 1000)
b = int((n % 1000) / 100)
c = int((n % 100) / 10)
d = int(n % 10)

if (a == b) :
    kotae = 1
if (b == c) :
    kotae = 1
if (c == d) :
    kotae = 1

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

Submission status: Accepted

Solution code:
s = int(input())

a = s % 10
b = s // 10 % 10
c = s // 100 % 10
d = s // 1000 % 10

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

Submission status: Accepted

Solution code:
S = str(input())

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

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

Submission status: Accepted

Solution code:
# coding: utf-8

S = input()

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

print('Good' if judge(S) else 'Bad')

Submission status: Accepted

Solution code:
S=input()
a="100"
flag=True
for i in S:
    if a==i:
        print("Bad")
        flag=False
        break
    a=i
if flag==True:
    print("Good")

Submission status: Accepted

Solution code:
S = input()
s = list(S)
buf = ""
flag = 0
for i in range(4):
    if(buf == s[i]):
        flag =1
    buf = s[i]
if flag == 1:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

Solution code:

s=int(input())

a=s//1000
b=s//100 - a*10
c=s//10-a*100-b*10
d=s%10



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

Submission status: Accepted

Solution code:
S=list(input())
pre_i=-1
result="Good"
for i in S:
    if i==pre_i:
        result="Bad"
        break
    else:
        pre_i=i
print(result)

Submission status: Accepted

Solution code:
S = input()

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

print("Good")

Submission status: Accepted

Solution code:
#data=list(input().split())
s=input()
last='.'
ans=0
for i in s:
    if last=='.':
        last=i
        continue
    if last==i:
       # print('Bad')
        ans=1
        break
    last=i
if ans==1:
    print('Bad')
else:
    print('Good')

Submission status: Accepted

Solution code:
s = input()
tmp = 11
flag = 0
for num in s:
    if tmp == int(num):
        flag += 1
        break
    tmp = int(num)
if flag > 0:
    print("Bad")
else:
    print("Good")

Submission status: Accepted

Solution code:
from sys import stdin

S = stdin.readline()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = list(input())
ret = "Good"
for i in range(1,len(a)):
    if a[i-1]==a[i]:
        ret="Bad"
        break
print(ret)

Submission status: Accepted

Solution code:
S=input()
f=0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())
_s = s[0]
ans = 'Good'

for x in s[1:]:
    if x == _s:
        ans = 'Bad'
        break
    _s = x

print(ans)

Submission status: Accepted

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


def solve(S: int):
    S = str(S)
    for i in range(len(S) - 1):
        if S[i] == S[i+1]:
            print ("Bad")
            return
    print("Good")
    return


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = input()
a = num[0]
b = num[1]
c = num[2]
d = num[3]
if a != b and b != c and c != d:
    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:
hoge = input()
code = list(hoge)

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

Submission status: Accepted

Solution code:
j = input()

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

print(a(j))

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()
lists = list(s)
ans = "Good"

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

    
print(ans)

Submission status: Accepted

Solution code:
S=list(map(int,input()))
X=0
for i in range(3):
    if S[i]==S[i+1]:
        X=0
        break
    else:
        X=1

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
pc = input()

if pc[0] != pc[1] and pc[1] != pc[2] and pc[2] != pc[3] :
  print("Good")
else :
  print("Bad")

Submission status: Accepted

Solution code:
strPass = input()

prev = ''
flag = False
for i in strPass:
    if i == prev:
        flag = True
    prev = i

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

status = True
for i in range(3):
  if s[i] == s[i + 1]:
    status = False
    
print('Good' if status 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:
def security(S: str)->bool:
    return S[0] != S[1] and S[1] != S[2] and S[2] != S[3]


if __name__ == "__main__":
    S = input()

    good = security(S)
    print('Good' if good else 'Bad')

Submission status: Accepted

Solution code:
S = input()
tmp = 'a'
flag = 0
for i in S:
    if tmp == i:
        flag = 1
        print('Bad')
        break
    tmp = i

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

Submission status: Accepted

Solution code:
s = input()
prev = -1
flag = 0
for elem in s:
    if prev is not None:
        if prev == elem:
            flag = 1
            prev = elem
        else:
            prev = elem
if flag == 0:
    print("Good")
else:
    print("Bad")

Submission status: Accepted

Solution code:
def f(text):
  for i,e in enumerate(text[:-1]):
    if e == text[i+1]:
      print('Bad')
      return
  print('Good')
  return 

text = input()
f(text)

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:
str = input()
L = [int(s) for s in str]

if L[0] == L[1]:
    ans = "Bad"
elif L[1] == L[2]:
    ans = "Bad"
elif L[2] == L[3]:
    ans = "Bad"
else:
    ans = "Good"

print(ans)

Submission status: Accepted

Solution code:
#a.py
s = input()
flag = True
bef = -1
for x in s:
    if x == bef:
        flag = False
    bef = x
if flag:
    print('Good')
else:
    print('Bad')

Submission status: Accepted

Solution code:
S = input()

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

print('Good')

Submission status: Accepted

Solution code:
S = list(input())

n = ''
flg = False
for c in S:
    if n == c:
        flg = True
        break
    else:
        n = c

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
print('Bad' if any(a == b for a, b in zip(s, s[1:])) else 'Good')

Submission status: Accepted

Solution code:
S=input()

s=0

t='t'
for i in range(4):
    if t==S[i]:
        s=1
    t=S[i]

if s==1:
    print('Bad')
else:
    print('Good')

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

Solution code:
def f(a):
    for i in range(1, len(a)):
        if a[i - 1] == a[i]:
            return 'Bad'
    return 'Good'


a = list(input())
print(f(a))

Submission status: Accepted

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

Submission status: Accepted

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

if cnt:
    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:
s = input()
a = 0

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

Submission status: Accepted

Solution code:
S = input()
prev = S[0]
for s in S[1:]:
  if s == prev:
    print('Bad')
    break
  prev = s
else:
  print('Good')

Submission status: Accepted

Solution code:
S  = input()
pre = ''
for i,s in enumerate(S):
    if i ==0:
        pre = s
        continue
    #print(i)
    if pre == s:
        print('Bad')
        exit(0)
    pre = s
print('Good')

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
s = str(input())
bef = ""
ans = "Good"
for i in range(4):
    if s[i] == bef:
        ans = "Bad"
        break
    bef = s[i]
print(ans)

Submission status: Accepted

Solution code:
S = int(input())
cnt = 0
if S//1000 == (S//100)%10:
  cnt += 1
if (S//100)%10 == (S//10)%10:
  cnt += 1
if (S//10)%10 == S%10:
  cnt += 1
if cnt == 0:
  print('Good')
else:
  print('Bad')