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: Wrong Answer

Solution code:
s=list(input())
if len(s)==len(list(set(s))):
  print("Good")
else:
  print("Bad")

Submission status: Wrong Answer

Solution code:
S = input()
for c in S:
    if 1 < S.count(c):
        print('Bad')
        exit
print('Good')

Submission status: Wrong Answer

Solution code:
A=list(input())
n=0
for i in range(len(A)-1):
  if A[i]==A[i+1]:
    n=1
    break
print("good"if n==0 else "bad")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = str(input())
number_list = []
count = 0
for number in s:
    number_list.append(number)
for i in range(3):
    if number_list[i] == number_list[i+1]:
        count += 1
    else:
        pass
if count == 0:
    print('Bad')
else:
    print('Good')

Submission status: Wrong Answer

Solution code:
n = input()
print(["Yes" if n[0] != n[1] != n[2] != n[3] else "No"][0])

Submission status: Wrong Answer

Solution code:
s = input()
flag = 'Yes'
for i in range(len(s)-1):
  if s[i] == s[i+1]:
    flag = 'No'
print(flag)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = str(input())
l = list(S)

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

Submission status: Wrong Answer

Solution code:
S = str(input())
l = list(S)
s = int(len(S))

num = 0
for i in range(s):
    for j in range(i+1, s):
        if l[i] == l[j]:
            num += 1
        else:
            num += 0

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

Submission status: Wrong Answer

Solution code:
S = str(input())
l = list(S)
s = int(len(S))

num = 0
for i in range(s):
    for j in range(i+1, s):
        if l[i] == l[j]:
            num += 1
        else:
            num += 0

if num == 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
S = str(input())
l = list(S)
s = int(len(S))

num = 0
for i in range(s-1):
    if l[i] == l[i+1]:
        print("Bad")
        sys.exit()
    else:
        num += 1
        if num == 3:
            print("Yes")

Submission status: Wrong Answer

Solution code:
a = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

number=input()

for n in range(0,2):
    if number[n]==number[n+1]:
        print('Bad')
        sys.exit()
print('Good')

Submission status: Wrong Answer

Solution code:
number=input()

count=0

for n in range(0,2):
    if number[n]==number[n+1]:
        count=1
        print('Bad')
        break
if count!=1:
    print('Good')

Submission status: Wrong Answer

Solution code:
number=input()

number = [int(x) for x in number]

count=0

for n in range(0,2):
    if number[n]-number[n+1] == 0:
        count=1
        print('Bad')
if count!=1:
    print('Good')

Submission status: Wrong Answer

Solution code:
number=input()

number = [int(x) for x in number]

count=0

for n in range(0,2):
    if number[n]-number[n+1] == 0:
        count=1
        print('Bad')
        break
if count!=1:
    print('Good')

Submission status: Wrong Answer

Solution code:
s = input()

for i in range(1,len(s)):
  if s[i-1] == s[i]:
    print('Bad')
    quit()
  else:
    pass

print('Yes')

Submission status: Wrong Answer

Solution code:
S=list(int(i) for i in input().split())
for x in range(len(S)-1):
  if S[x]==S[x+1]:
    print('Bad')
    break 
else:
  print('Good')

Submission status: Wrong Answer

Solution code:
S=list(int(i) for i in input().split())
for x in range(len(S)-1):
  if S[x]==S[x+1]:
    print('Bad')
  break 
else:
  print('Good')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A = list(input())
B = A[0:2]
C = A[1:3]
D = A[2:4]
E = [x for x in set(B) | set(C) | set(D) if B.count(x) > 1 or C.count(x) > 1 or D.count(x) > 1]
if len(E) == 1:
    print("Bad")
else:
    print("Good")

Submission status: Wrong Answer

Solution code:
S = list(input().split())
for i in range(1, len(S)):
  if S[i-1]==S[i]:
    print("Bad")
    exit()
print("Good")

Submission status: Wrong Answer

Solution code:
import sys

s = input()
n = len(s)
for i in range(1,n-1):
  if s[i] == s[i-1]:
    print("Bad")
    sys.exit()
if s[n-1] != s[n-2]:
  print("Good")

Submission status: Wrong Answer

Solution code:
A = list(input())
B = A[0:2]
C = A[1:3]
D = A[2:]
E = [x for x in set(B) or set(C) or set(D) if B.count(x) > 1 or C.count(x) > 1 or D.count(x) > 1]
if  len(E) == 1:
    print("Bad")
else:
    print("Good")

Submission status: Wrong Answer

Solution code:
A = list(input())
B = A[0:2]
C = A[1:3]
D = A[2:4]
E = [x for x in set(B) or set(C) or set(D) if B.count(x) > 1 or C.count(x) > 1 or D.count(x) > 1]
if  len(E) == 1:
    print("Bad")
else:
    print("Good")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
w=input();print("GBOAODD"[1^(w[0]!=w[1]!=w[2]!=w[3])::2])

Submission status: Wrong Answer

Solution code:
l = list(input())
p = [int(i) for i in l]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from copy import *
from sys import *
import math
import queue
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)

#dp[i][j]: iまでからj枚えらんで和がkになるのは何通り
def main():
	s =  input()
	if(s[0]==s[1] or s[1]==s[2] or s[2]==s[3]):
		print('Yes')
	else:
		print('No')

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(m,n):
	x = max(m,n)
	y = min(m,n)
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	return y

class queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

Submission status: Wrong Answer

Solution code:
a = list(input())
if len(a) == len(set(a)):
    print("Good")
else:
    print("Bad")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
if (len(S) == 4) & (S.count(S[0]+S[1]) == 2) & (S[0] != S[1]):
    print("Good")
else:
    print("Bad")

Submission status: Wrong Answer

Solution code:
S = input()
if (S.count(S[0]+S[1]) == 2):
    print("Good")
else:
    print("Bad")

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

Solution code:
import io
import sys


def IN_S():
  return input()


def IN_I():
  return int(input())


def IN_L_I():
  return list(map(int, input().split()))


def IN_L_S():
  return list(map(str, input().split()))


def STR_SPLIT(s, n):
  for l in range(0, len(s), n):
    yield s[0 + l:n + l]


def T_IN():
  global test_str
  sys.stdin = io.StringIO(test_str[1:-1])


test_str = '''
1234
'''


def MAIN():
  T_IN()
  A()


def A():
  s = IN_S()

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

  print("Good")


  return None
 

def B():
  return None


def C():
  return None


MAIN()

Submission status: Wrong Answer

Solution code:
import re
S = input()

pat = r"(\d)\1"

res = re.search(pat, S)

print(res)

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

Submission status: Wrong Answer

Solution code:
import math

def main():
    S = input()
    flag = 1
    for i in range(1, len(S)):
       if S[i] == S[i-1]:
           print("Bad")
           flag=0
       else:
           pass
    if flag:
        print("Good")

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
cord = "1233"
cord_len = len(cord)
for i in range(cord_len - 1):
    if cord[i] == cord[i + 1]:
        print("Bad")
        break
else:
    print("Good")

Submission status: Wrong Answer

Solution code:
s=input()
answer='GOOD'
for i in range(len(s)-1):
  if s[i]==s[i+1]:
    answer='BAD'
    break
print(answer)

Submission status: Wrong Answer

Solution code:
S = input()
if (S.count(S[0]+S[1]) == 2) & (S[0] != S[1]):
    print("Good")
else:
    print("Bad")

Submission status: Wrong Answer

Solution code:
S = input()
if S.count(S[0]+S[1]) == 2:
    print("Good")
else:
    print("Bad")

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
s = input()
print("Good" if len(set(s)) == 4 else "Bad")

Submission status: Wrong Answer

Solution code:
S = input()
l = list(S)
count = 0
for i in range(1,4) :
  if l[i] == l[i-1] :
    count += 1
  else :
    pass
if count == 3 :
  print('Good')
else :
  print('Bad')

Submission status: Wrong Answer

Solution code:
x =  [int(s) for s in  list(input())]
num = []
for s in x:
    if(len(num) == 0):
        num.append(s)
    else:
        if(num[len(num)-1] == s):
            print('Bad')
            exit
        else:
            num.append(s)

if(len(num) == 4):print('Good')

Submission status: Wrong Answer

Solution code:
st = input()
pre_s = st[0]
for i in range(1, len(st)):
  now_s = st[1]
  if st[1] == pre_s:
    print("Bad")
    break
  pre_s = st[1]
print("Good")

Submission status: Wrong Answer

Solution code:
s = input()
checker = True
for i in range(3):
    a , b = int(s[i]), int(s[i+1])
    if a == b:
        checker=False

if checker:
    print("Good")
else:
    print("bad")

Submission status: Wrong Answer

Solution code:
import re
s = input()
pattern = r"(00|11|22|33|44|55|66|77|88|99)"
if(re.match(pattern, s)):
	print("Bad")
else:
	print("Good")

Submission status: Wrong Answer

Solution code:
import re
s = input()
pattern = r"(00|11|22|33|44|55|66|77|88|99)"
if(re.match(pattern, s)):
  print("Bad")
else:
  print("Good")

Submission status: Wrong Answer

Solution code:
import re
s = input()
pattern = r"(00)|(11)|(22)|(33)|(44)|(55)|(66)|(77)|(88)|(99)"
if(re.match(pattern, s)):
  print("Bad")
else:
  print("Good")

Submission status: Wrong Answer

Solution code:
import re
s = input()
pattern = r"\d{2,}"
if(re.match(pattern, s)):
  print("Bad")
else:
  print("Good")

Submission status: Wrong Answer

Solution code:
import re
s = input()
pattern = r"\d{2}"
if(re.match(pattern, s)):
  print("Bad")
else:
  print("Good")

Submission status: Wrong Answer

Solution code:
import re
s = input()
pattern = r"\d{2}"
if(re.match(pattern, s)):
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
import re
s = input()
pattern = r"\d{2}"
if(re.match(pattern, s)):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
S = input()
check = 0

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

if check == 0:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
a=input()

if a in '11' or '22' or '33' or '44' or '55' or '66' or '77' or '88' or '99' or '00':
  print('Bad')
  
else:
  print('Good')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S=int(input())
A=[]
i=0
for x in range(0,4):
    A.append(S%10)
    S=S//10
if A[0]==A[1]:
    i=1
if A[0]==A[2]:
    i=1
if A[0]==A[3]:
    i=1
if A[1]==A[2]:
    i=1
if A[1]==A[3]:
    i=1
if A[2]==A[3]:
    i=1
if i==0:
    print("Good")
else:
    print("Bad")

Submission status: Wrong Answer

Solution code:
A=str(input () )
B=0
while B!=2:
    if A[B]==A[B+1]:
        print('Bad')
        break
    else:    
        B=B+1
else:
    print('Good')

Submission status: Wrong Answer

Solution code:
A=str(input () )
B=0
while B != 2:
    if A[B]==A[B+1]:
        print('Bad')
        break
    else:    
        B=B+1
else:
    print('Good')

Submission status: Wrong Answer

Solution code:
a = int(input())
print(a)
b = a%10
print(b)
c = int(((a-b)/10)%10)
print(c)
d = int(((a-b-c*10)/100)%10)
print(d)
e = int(((a-b-c*10-d*100)/1000)%10)
print(e)
mylst = [e, d, c, b]
if e == d:
    print("Bad")
elif d == c:
    print("Bad")
elif c == b:
    print("Bad")
else:
    print("Good")

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
import collections


S = list(input())

c = collections.Counter(S)

if max(c.values()) >= 2:
  print("Bad")
else:
  print("Good")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print('Yes')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a=list(input())
winFlag=True
for i,it in enumerate(a[1:]):
    if(a[i-1]==it):
        winFlag=False
if winFlag==False:
    print("Good")
else:
    print("Bad")

Submission status: Wrong Answer

Solution code:
import sys
s = input()
pre = ''
for i in s:
  if pre == i:
    print('Bad')
    sys.exit()
print('Good')

Submission status: Wrong Answer

Solution code:


S=input()


for i in range(len(S)):
    A=S[i:i+1]
    print(A)

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

Submission status: Wrong Answer

Solution code:


S=input("input 4 num")

for i in range(len(S)):
    A=S[i:i+1]
    print(A)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
ls = list(map(int,input()))
for i in range(len(ls)-1):
  if(ls[i] == ls[i+1]):
    print("bad")
    exit()
print("good")

Submission status: Wrong Answer

Solution code:
pi=""
j="Good"
for i in input():
  if pi == i:
    j="Bad"
print(j)

Submission status: Wrong Answer

Solution code:
s = input()
ans = True
for i in s:
    if(abs(s.find(i)-s.rfind(i)) != 0):
        ans = False
if ans == True:
    print("Good")
else:
    print("Bad")

Submission status: Wrong Answer

Solution code:
s = input()
ans = True
for i in s:
    if(abs(s.find(i)-s.rfind(i)) == 1):
        ans = False
if ans == True:
    print("Good")
else:
    print("Bad")

Submission status: Wrong Answer

Solution code:
s = input()
ans = True
for i in s:
    if(abs(s.find(i)-s.rfind(i)) == 1):
        ans = False
if ans == True:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import re

security_code = input()
regex = r'(.)\1'
result = re.match(regex, security_code)

if result is None:
  print('Good')
else:
  print('Bad')

Submission status: Wrong Answer

Solution code:
import re

security_code = input()
regex = r'(.)\1'
result = re.match(regex, security_code)

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

Submission status: Wrong Answer

Solution code:
pas=list(input())
if pas[0]==pas[1] or pas[1]==pas[2] or pas[2]==pas[3]:
    print('bad')
else:
    print('good')

Submission status: Wrong Answer

Solution code:
#coding:utf-8
import sys

L = list(input())
print(L)
for i in range(len(L)):
    for j in range(len(L)):
        if (i != j) and (abs(i-j) == 1) and (L[i] == L[j]):
            print("Bad")
            sys.exit()
print("Good")

Submission status: Wrong Answer

Solution code:
#coding:utf-8
import sys

L = list(input())
for i in range(len(L)):
    for j in range(len(L)):
        if (i != j) and L[i] == L[j]:
            print("Bad")
            sys.exit()
print("Good")

Submission status: Wrong Answer

Solution code:
inputs = input()

pre_num = "x"
for num in inputs:
    if pre_num == num:
        print("bad")
        exit()
    pre_num = num

print("good")

Submission status: Wrong Answer

Solution code:
s=input()
f=-1
print(s)
b=' '
l=len(s)
if l==4:
	f=0
	for i in range(l):
		if(s[i]<'0' or s[i]>'9'):
			f=-1
			break;
		elif(s[i]==b):
			f=1
			break;
		else:
			b=s[i]
if(f==-1):
	print('Illegal')
elif(f==1):
	print('Bad')
else:
	print('Good')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = int(input())
if (int(S / 100) % 11) * (int((S % 1000) / 10) % 11) * ((S / 100) % 11) == 0:
  print("Bad")
else:
  print("Good")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = int(input())
t = -1;	f = True
while s:
  if t == s%10:
    f = False
  t = s%10
  s //= 10
print('Good' if f else 'Bad')

Submission status: Wrong Answer

Solution code:
s = input()
f = True
for i in range(2):
  if s[i] == s[i+1]:
    f = False
print('Good' if f else 'Bad')

Submission status: Wrong Answer

Solution code:
S = list(input())
S1 = sorted(S)

if S1[0] == S1[1] and S1[2] == S1[3] and S1[1] != S[2]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c,d = sorted(input())
print ("Bad")

Submission status: Wrong Answer

Solution code:
inputs = input()

if inputs[0]==inputs[1] or inputs[1]==inputs[2] or inputs[2]==inputs[3]:
  print("bad")
else:
  print("good")

Submission status: Wrong Answer

Solution code:
S = map(int, input())
t = str(S)
a = 0
b = 0
for n in range(3):
  if t[n] == t[n+1]:
    b += 1
if b == 0:
  print("Good")
else:
  print("Bad")

Submission status: Wrong Answer

Solution code:
x = input()
def samenum(string):
  for i in range(3):
    if string[i] == string[i+1]:
        return "Bad"
        quit()
  return "Good"

Submission status: Wrong Answer

Solution code:
A,B,C,D = 10, 40, 6, 8
#最大公約数
def gcd(x, y):
    if x == 0:
        return y
    else:
        return gcd(y % x, x)
#最小公倍数
def lcm(x,y):
    return x * y // gcd(x,y)
L = lcm(C,D)
b = B - (B // C) - (B // D) + (B // L)
a = (A-1) - ((A-1) // C) - ((A-1) // D) + ((A-1) // L)
print(b - a)

Submission status: Wrong Answer

Solution code:
num = input()
 
n='X'
ans='Good'
for i in range(1,4,1):
  if n==num[i]:
    ans='Bad'
    break
  else:
    n=num[i]
print(ans)

Submission status: Wrong Answer

Solution code:
num = input()

n='X'
ans='Good'
for i in range(1,4,1):
  if n==num[i]:
    print('Bad')
    break
  else:
    n=num[i]
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input()

isGood = False

if a[0] == a[1]: isGood = True
elif a[1] == a[2]: isGood = True
elif a[2] == a[3]: isGood = True

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
S = input()
beforeChar = '0'
for s in S:
    if (beforeChar == s):
        print('Bad')
        sys.exit()
    beforeChar = s

print('Good')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = list(input())

prev = S[0]
ans = 'Good'

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

Submission status: Wrong Answer

Solution code:
S = list(input())

prev = S[0]
ans = 'Good'

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

Submission status: Wrong Answer

Solution code:
S = list(map(int, input().split()))

prev = S[0]
ans = 'Good'

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

Submission status: Wrong Answer

Solution code:
S = input()

l = list(S)

print(l)

f = False

for i, s in enumerate(l):
    if s == l[i-1]:
        f = True
        break

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

Submission status: Wrong Answer

Solution code:
a = input()
for i in range(0, 2):
  if(a[i] == a[i+1]):
    b = False
    break
  elif(a[i] != a[i+1]):
    b = True
if(b == False):
  print("Bad")
else:
  print("Good")

Submission status: Wrong Answer

Solution code:
a = input()
for i in range(0, 2):
  if(a[i] == a[i+1]):
    b = False
    break
  elif(a[i] != a[i+1]):
    b = True
if(b == False):
  print("Bad")
else:
  print("True")

Submission status: Wrong Answer

Solution code:
a = input()
for i in range(0, 2):
  if(a[i] == a[i+1]):
    b = False
    break
  elif(a[i] != a[i+1]):
    b = True
if(b == True):
  print("Good")
else:
  print("Bad")

Submission status: Wrong Answer

Solution code:
a = input()
for i in range(0, 2):
  if(a[i] == a[i+1]):
    b = False
    break
  else:
    b = True
if(b == True):
  print("Good")
else:
  print("Bad")

Submission status: Wrong Answer

Solution code:
password = list(input())
for i in range(len(password)):
  for j in range(i+1, len(password)):
    if password[i] == password[j]:
      print("Bad")
      break
print("Good")