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:
def checker(s):
    for i,v in enumerate(s[1:]):
        if s[i-1] == s[i]:
            return("Bad")
    return("Good")
s = input()

print(checker(s))

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

Solution code:
def check_key(S, key_length):
    for i,k in enumerate(S):
        if k == S[i+1]:
            return 'bad'
        if i == key_length - 1:
            return 'Good'
        else:
            continue
S = "3776"
key_length = len(S)
print(check_key(S, key_length))

Submission status: Wrong Answer

Solution code:
n=int(input())

l=[]
for i in range(4):
    a=n%10
    n=int(n/10)
    l.insert(0,a)
ans="Good"
for i in range(2):
   if(l[i]==l[i+1]):
       ans="Bad"

       
print (ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python
# -*- Coding: utf-8 -*-
import re


a=input()


if len(a) == len(re.sub("([0-9])\\1(?!\\1)", "", a)) and len(a) == 4:

    print("Good")

else:

    print("bad")

Submission status: Wrong Answer

Solution code:
a=int(input())
b=[int(x) for x in list(str(a))]
for i in range(len(b)-1):
  if b[i] ==b[i+1]:
    print("Bad")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python
# -*- Coding: utf-8 -*-
import re
 
if __name__ == '__main__':
 
    a=input()	

    if len(a) == len(re.sub("([0-9])\\1(?!\\1)", "", a)):
        print("Good")
    else:
        print("bad")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

aa = int(a)
bb = int(b)
cc = int(c)
dd = int(d)
 
if aa==bb:
  print("bad")
elif bb==cc:
  print("bad")
elif cc==dd:
  print("bad")
else:
  print("good")

Submission status: Wrong Answer

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

aa = int(a)
bb = int(b)
cc = int(c)
dd = int(d)
 
if aa==bb:
    print("bad")
elif bb==cc:
    print("bad")
elif cc==dd:
    print("bad")
else:
    print("good")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())
b = a // 1000
c = a // 100 - b*10
d = a // 10 - b*100 - c*10 
e = a - a*1000 - b*100 - c*10
if a == b or b == c or c == d:
  print('Bad')
else:
  print('Good')

Submission status: Wrong Answer

Solution code:
#S = input()
S = '3766'

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def check_pass(ps):
    for i in range(len(ps) - 1):
        dif = ps[i] - ps[i + 1]
        if dif == 0:
            print("bad")
            return ""
    print("good")
    return ""


# input process
inputData = input()
ps = [int(x) for x in inputData]

check_pass(ps)

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

Solution code:
number = input()
before = number[0]
flg = 0
for i in number:
  if i==before:
    print('Bad')
    flg = 1
    break
  else:
    before = i
if flg == 0:
  print('Good')

Submission status: Wrong Answer

Solution code:
number = input()
before = number[0]
for i in number:
  if i==before:
    print('Bad')
    break
  else:
    before = i

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def main():
    S = list(str(input()))
    #print(S)
    for i in range(len(S)):
        if i == 0:
            t = S[0]
            continue
        else:
            t = S[i-1]
            print(t)
            if t == S[i]:
                print('Bad')
                return
    print('Good')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
s = input()

flag = True
for i in range(len(s)-1):
  if s[i] == s[i+1]:
    print("Bad")
    flag = False
 
if flag:
  print("Good")

Submission status: Wrong Answer

Solution code:
s_code = map(int, input())

if len(list(s_code)) == len(list(set(s_code))):
  print('Good')
else:
  print('Bad')

Submission status: Wrong Answer

Solution code:
import re


def judge(S):
	S_list  = list(str(S))  #list化
	
	i_pure = None
	for i in S_list:
		if i == i_pure:
			return 'Bad'
		i_pure = i

	return 'Good'


# S = ['3776','8080','1333','0024']

S = input('input:')
# for s in S:
# 	print(judge(s))

print(judge(S))

Submission status: Wrong Answer

Solution code:
n=int(input())
a=int(n/1000)
an=n-a*1000
b=int(an/100)
bn=an-b*100
c=int(bn/10)
d=bn-c*10

if(a==b or b==c or c==d):
    print("bad")
else:
    print("good")

Submission status: Wrong Answer

Solution code:
a = input().split()
b = list(map(int,a[0]))
if len(b) == len(set(b)):
    print('Good')
else:
    print('Bad')

Submission status: Wrong Answer

Solution code:
import re


def judge(S):
	S_list  = list(str(S))  #list化
	
	i_pure = None
	for i in S_list:
		if i == i_pure:
			return 'Bad'
		i_pure = i

	return 'Good'


S = ['3776','8080','1333','0024']
for s in S:
	print(judge(s))

Submission status: Wrong Answer

Solution code:
import sys
from io import StringIO
import unittest


def resolve():
    S = input()
    a = 0
    for i in range(len(S) - 1):
        if (S[i] == S[i + 1]):
            a = 1
    if (a == 0):
        print("Good")
    else:
        print("Bad")


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """3776"""
        output = """Bad"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """8080"""
        output = """Good"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """1333"""
        output = """Bad"""
        self.assertIO(input, output)

    def test_入力例_4(self):
        input = """0024"""
        output = """Bad"""
        self.assertIO(input, output)


if __name__ == "__main__":
    unittest.main()

Submission status: Wrong Answer

Solution code:
S = raw_input()
flag = True

print S

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = list(input())
l = [int(t) for t in s] 
i=1
ans= "Good"
for i in range(3):
   if (l[i-1]==l[i]):
       ans= "Bad"
       break

print(ans)

Submission status: Wrong Answer

Solution code:
s = int(input())
n = []
f = 0

if(s < 10):
    n.append(0)
    n.append(0)
    n.append(0)
elif(s < 100):
    n.append(0)
    n.append(0)
else:
    n.append(0)

while s > 0:
    n.append(s % 10)
    s = s // 10

n.reverse()

for i in range(1,len(n)):
    if(n[i] == n[i -1]):
        f = 1
        break

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

Submission status: Wrong Answer

Solution code:
#入力取得
s = int(input())

nums = ['00',11,22,33,44,55,66,77,88,99]

flag = 0

for i in nums:
    if str(i) in str(s):
        flag = 1
        break


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#入力取得
s = int(input())

nums = [00,11,22,33,44,55,66,77,88,99]

flag = 0

for i in nums:
    if str(i) in str(s):
        flag = 1
        break


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

Submission status: Wrong Answer

Solution code:
import re
s = input()
pattern = ".{2,4}"
if re.search(pattern,s):
        print("Bad")
else:
        print("Good")

Submission status: Wrong Answer

Solution code:
s=input()
result = True

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#入力取得
s = int(input())

nums = [11,22,33,44,55,66,77,88,99]

flag = 0

for i in nums:
    if str(i) in str(s):
        flag = 1
        break


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

Submission status: Wrong Answer

Solution code:
S = input()
T = 0

for i in range(3):
    if S[i] == S[i + 1]:
        T += 1
    elif S[i] == S[i - 1]:
        T += 1

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

Submission status: Wrong Answer

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

a = 0

for i in range(Sc-2):
    if S[i] == S[i+1]:
        print("Bad")
        a += 1
        break


if a == 0:
    print("Good")

Submission status: Wrong Answer

Solution code:
import re
s = input()
pattern = ".{2,4"
if re.search(pattern,s):
        print("Bad")
else:
        print("Good")

Submission status: Wrong Answer

Solution code:
s = list(input())
l = [int(t) for t in s] 
i=1
ans= "Good"
for i in range(4):
   if (l[i-1]==l[i]):
       ans= "Bad"
       break

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())
b=a%10
c=(a-b)/10
judg="Good"
for i in range(4):
    if b==c%10:
        judg="Bad"
    else:
        b=c%10
        c=(c-b)/10
print(judg)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = list(map(lambda x: int(x),input().split()))
judge = True
for i in range(len(s)-1):
    if s[i]==s[i+1]:
        judge=False
        break
if judge:
    print("Good")
else:
    print("Bad")

Submission status: Wrong Answer

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

a = 0

for i in range(Sc-2):
    if S[i] == S[i+1]:
        print("Bad")
        a += 1


if a == 0:
    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")
print("Good")

Submission status: Wrong Answer

Solution code:
s = input()
ans = False
for i in range(0, 2):
    if s[i] == s[i + 1]:
        ans = True
if ans:
    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("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = list(input())
l = [int(t) for t in s] 
i=1
ans= "good"
for i in range(4):
   if (l[i-1]==l[i]):
       ans= "bad"
       break

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

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

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

Submission status: Wrong Answer

Solution code:
s=input()
result = True

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

Submission status: Wrong Answer

Solution code:
S=int(input())
a=S//1000
b=(S-1000*a)//100
c=(S-1000*a-100*b)//10
d=S-1000*a-100*b-10*c
if a==b or a==c or a==d or b==c or b==d or c==d:
  print('Bad')
else:
  print('Good')

Submission status: Wrong Answer

Solution code:
def judge(S):
  S = [int(i) for i in str(S)]
  delta1 = S[1]-S[0]
  delta2 = S[2]-S[1]
  delta3 = S[3]-S[2]
  
  if delta1 * delta2 * delta3 == 0:
    print('Bad')
  else:
    print('Good')

Submission status: Wrong Answer

Solution code:
line = input()

chars = list(map(int, line))

result = 0

for char_i in range(len(chars)):
  pre_char = chars[char_i-1]
  char = chars[char_i]
  
  if char == pre_char:
    result = 1
    
if result == 0:
  print("Good")
else:
  print("Bad")

Submission status: Wrong Answer

Solution code:
#import collections
Sin = input()
#print(Sin)
S = [int(x) for x in list(str(Sin))]
#print(S)
test = 0
for i in range(0,3):
#    print(i)
    if S[i+1] == S[i]:
        print("Bad")
        test = 1
        
if test !=1:
    print("Good")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = list(map(int,input()))
bool = 0
for i in range(len(N) - 1):
    if N[i] != N[i+1]:
        bool = 1
if bool == 1:
    print("Good")
else:
    print("Bad")

Submission status: Wrong Answer

Solution code:
#import collections
Sin = input()
#print(Sin)
S = [int(x) for x in list(str(Sin))]
#print(S)
test = 0
for i in range(0,3):
    print(i)
    if S[i+1] == S[i]:
        print("Bad")
        test = 1
        
if test !=1:
    print("Good")

Submission status: Wrong Answer

Solution code:
S = str(input())
a = int(S[0])
b = int(S[1])
c = int(S[2])
d = int(S[3])

def afunc(a,b,c,d):
  alist = [a,b,c,d]
  pre = a
  for char in alist[1:3]:
    if pre == char:
      print("Bad")
      return
    else:
      pre = char
  print("Good")

afunc(a,b,c,d)

Submission status: Wrong Answer

Solution code:
s=list(input())
ans='Good'
for i in s:
    if 1 < s.count(i):
        ans='Bad'
print(ans)

Submission status: Wrong Answer

Solution code:
s = int(input())
n = []
f = 0
while s > 0:
    n.append(s % 10)
    s = s // 10
    
n.reverse()

if(len(n) < 4):
    f  = 1

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

Submission status: Wrong Answer

Solution code:
S=int(input())
if S<100:
    print('Bad')
elif ((S-(S%100))%1100!=0 or (S-(S-(S%1000))-(S%10))%110!=0 or (S%100)%1100!=0):
    print('Good')
else:
    print('Bad')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python
# -*- Coding: utf-8 -*-
import re

def nchars(s, n):
    assert n > 0
    reg = re.compile("(.)\\1{%d,}" % (n - 1))  # カンマを取ると n 個ちょうどになる
    while True:
        m = reg.search(s)
        if not m:
            break
        yield m.group(0)
        s = s[m.end():]


if __name__ == '__main__':

    a=input()	
    
    if len(list(nchars(a,2))) == 0 :
        print("Good")
    else:
        print("bad")

Submission status: Wrong Answer

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

def main():
    S = list(input())
    S.append("_")
    for i in range(len(S)-1):
        print(i)
        if S[i] == S[i+1]:
            return "Bad"
    return "Good"
print(main())

Submission status: Wrong Answer

Solution code:
R = input()
S = [s for s in R]
T = set(S)
if len(S) > len(T):
    print('Bad')
else:
    print('Good')

Submission status: Wrong Answer

Solution code:
s=input()
result = True

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

Submission status: Wrong Answer

Solution code:
import math

a = list(map(int, input().split()))
a = a[0]

x=a%10
y=a//10%10
z=a//100%10
w=a//1000

if(x!=y and y!= z and z!= w):
    print("Good")
else:
    print("Bad")
    
print(x,y,z,w)

Submission status: Wrong Answer

Solution code:
N =str(input())
pre = "0"
count = 0
for i in range(4):
    if N[i] == pre:
        count += 1
    pre = N[i]
if count > 0:
    print('Bad')
else:
    print('Good')

Submission status: Wrong Answer

Solution code:
S = input()

S_list = list(S)

if len(S_list) != len(set(S_list)):
    print("Bad")
if len(S_list) == len(set(S_list)):
    print("Good")

Submission status: Wrong Answer

Solution code:

def main():
    k = input()
    flg = False
    for i in range(len(k)):
        for j in range(i+1, len(k)):
            if k[i] == k[j]:
                flg = True
                break
    if flg: print("Bad")
    else: print("Good")

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
s = list(input())

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

Submission status: Wrong Answer

Solution code:
def main():

    s = input()
    s = str(s)
    flag = 0

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
line = input()

chars = list(map(int, line))

result = 0

for char_i in range(len(chars)):
  pre_char = chars[char_i-1]
  char = chars[char_i]
  
  if char == pre_char:
    result = 1
  else:
    continue
    
if result == 0:
  print("Good")
else:
  print("Bad")

Submission status: Wrong Answer

Solution code:
def judge(S):
  S = [int(i) for i in S]
  delta1 = S[1]-S[0]
  delta2 = S[2]-S[1]
  delta3 = S[3]-S[2]
  
  if delta1 * delta2 * delta3 == 0:
    print('Bad')
  else:
    print('Good')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input()

prev = a[0]

flag = False

for i in range(1, 4):
  if (prev == a[i]):
    flag = True
    break

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

Submission status: Wrong Answer

Solution code:
S=int(input())
if S>100:
    print('Bad')
elif ((S-(S%100))%1100!=0 or (S-(S-(S%1000))-(S%10))%110!=0 or (S%100)%1100!=0):
    print('Good')
else:
    print('Bad')

Submission status: Wrong Answer

Solution code:
import collections
Sin = input()
#print(Sin)
S = [int(x) for x in list(str(Sin))]
#print(S)
test = 0
for i in range(0,3):
#    print(i)
    if S[i+1] == S[i]:
        print("Bad")
        test = 1
if test ==0:
    print("Good")

Submission status: Wrong Answer

Solution code:
x = input()
x = str(x)
f = True

for i in range(1,3):
  if(x[i-1] == x[i]):
    f = False
    break
   
if f:
  print("Good")
else:
  print("Bad")

Submission status: Wrong Answer

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

s = str(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:
# -*- coding: utf-8 -*-
def main():
    S = int(input())
    l = [int(x) for x in list(str(S))]
    #print(l)
    t = l[0]
    for i in range(len(l)):
        if i != 0:
            t = l[i-1]
            if t == l[i]:
                print('Bad')
                return
    print('Good')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
S = input()

n=100
check=0

for i in S:
    if i==n:
        check=0
    
    n=i

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

Submission status: Wrong Answer

Solution code:
inp = int(input())
def a(inp):
    strin = str(inp)
    for x in range(3):
        if len(strin)<4:
            return 'Bad'
        if strin[x]==strin[x+1]:
            return 'Bad'
    return 'Good'
print(a(inp))

Submission status: Wrong Answer

Solution code:
s = list(input())

a = int(s[0])
for i in range(1,len(s)) :
    if (a == int(s[i])):
        print("Bad")
        exit()
    a = s[i]
print("Good")

Submission status: Wrong Answer

Solution code:
S = str(input())
cnt = 0
for i in range(len(S)-1):
    if S[i] == S[i+1]:
        print("Bad")
        print(S[i],S[i+1])
        exit()
print("Good")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

def check(S):
    before = ''
    for c in S:
        if before == c:
            print('Bad')
            return
        before = c

    print("good")
    return

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

Submission status: Wrong Answer

Solution code:
S = str(input())

def judge():
    now = None
    for i in S:
        if now == i:
            print("Bad")
            return
        now = i
    print("good")

judge()

Submission status: Wrong Answer

Solution code:
sec_number = input()
answer = False
for i in range(4):
  if sec_number[i] == sec_number[i-1]:
    answer = True
if answer:
  print("Bad")
else:
  print("Good")

Submission status: Wrong Answer

Solution code:
N = list(map(int,input()))
if len(set(N)) == len((N)):
    print("Good")
else:
    print("Bad")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import collections
Sin = input()
#print(Sin)
S = [int(x) for x in list(str(Sin))]
#print(S)
test = 0
for i in range(len(S)-1):
    if S[i+1] == S[i]:
        print("Bad")
        test = 1
if test ==0:
    print("Good")

Submission status: Wrong Answer

Solution code:
s = list(input())

for i in range(len(s)):
    if s.count(s[i]) == 1:
        print("Good")
        quit()
print("Bad")

Submission status: Wrong Answer

Solution code:
S=list(input())
flag=0
b='a'
for s in S:
    if b==s:
        flag=1
    b=s
if flag==0:
    print("Bad")
else:
    print("Good")

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

Solution code:
def main():

    s = map( int, input().split())
    s = str(s)

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

Solution code:
s=input()

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

Submission status: Wrong Answer

Solution code:
import sys
inputs = sys.stdin.readlines()

chars = inputs[0]
if len(chars) != len(set(chars)):
    print('Bad')
else:
    print('Good')

Submission status: Wrong Answer

Solution code:
def main():
  inp = input()
  before =None
  for a in inp:
    if before is None:
      before = a
      continue
    if before == a:
      print("Bad")
      return
    before = a
  print("Good")

Submission status: Wrong Answer

Solution code:
s = input()
a = []
a = list(s)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
ans = "Good"

for i in range(0, 2):
    if S[i] == S[i + 1]:
        ans = "Bad"

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
N += 10000
if (N % 100) % 11 == 0:
    print("Bad")
elif (N - (N % 10)) / 10 % 11 == 0:
    print("Bad")
elif (N - (N % 100)) / 100 % 11 == 0:
    print("Bad")
else:
    print("Good")

Submission status: Wrong Answer

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

tmp = S.pop()
for i in S:
    if tmp == i:
        print('Bad')
        break
    tmp = i
else:
    print('Good')

Submission status: Wrong Answer

Solution code:
import sys

x = str(input())

for i in range(2):
    if x[i] == x[i+1]:
        print('Bad')
        sys.exit()

print('Good')

Submission status: Wrong Answer

Solution code:
s = int(input())

rtn = "Good"
u = -1
for i in range(4):
    t = s % 10
    if (t == u) :
        rtn = "Bad"
    u = t
    t //= 10

print(rtn)

Submission status: Wrong Answer

Solution code:
# 文字列の入力
s = input()
check = [0,0,0,0,0,0,0,0,0,0]
for i in range(len(s)):
    check[int(s[i])]+=1
if max(check) ==1:
    print('Good')
else:
    print('Bad')

Submission status: Wrong Answer

Solution code:
n = set()
s = input()

for i in range(4):
    n.add(s[i])

    

if len(n) == 4:
    print("Good")
else:
    print("Bad")

Submission status: Wrong Answer

Solution code:
s = list(input())

a = int(s[0])
for i in range(1,len(s)) :
    if (a == s[i]):
        print("Bad")
        exit()
    a = s[i]
print("Good")

Submission status: Wrong Answer

Solution code:
S = input()
a = {}
for s in S:
    a[s] = 1
if len(a) < 4:
    print('Bad')
else:
    print('Good')

Submission status: Wrong Answer

Solution code:
x=input()
ans="Good"
for i in range(0,2):
        if x[i]==x[i+1]:
                ans="Bad"
print(ans)

Submission status: Wrong Answer

Solution code:
S=list(input())
flag=0
b=0
for s in S:
    if b==s:
        flag=1
    b=s
if flag==0:
    print("Bad")
else:
    print("Good")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
a = 0
bad = 0
for i in range(4):
    a = S[i]
    if a == S[i-1]:
        print("Bad")
        bad = 1
        break
if bad != 1:
    print("Good")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

ans = s[0]
t = 'Good'
for i in s[:1]:
    if ans == i:
        t = 'Bad'
        break

print(t)

Submission status: Wrong Answer

Solution code:
s=input()
r="g↨ood"
for i in range(len(s)-1):
  if s[i]==s[i+1]:
    r="b↨ad"
    break
print(r)

Submission status: Wrong Answer

Solution code:
N = int(input())
if (N % 100) % 11 == 0:
    print("Bad")
elif (N - (N % 10)) / 10 % 11 == 0:
    print("Bad")
elif (N - (N % 100)) / 100 % 11 == 0:
    print("Bad")
else:
    print("Good")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
flag = True

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

if flag:
    print('good')
else:
    print('bad')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys;
import string;
sys.setrecursionlimit(20000) # 再起呼び出しの最大数をセット

import copy
import itertools

from functools import lru_cache
#@lru_cache(maxsize = None)

PPP = 1000000007

# 整数の入力
#n = int(input())

# スペース区切りの整数の入力
#a = [int(x) for x in input().split()]
#n, m = map(int, input().split())
#print("sp", n, k, file=sys.stderr)
#p, q, r = map(int, input().split())
#s = [int(x) for x in input().split()]
#t = [int(x) for x in input().split()]

# 改行区切りの整数の入力
#a = []
#for x in range(n):
#  a.append(int(input()))
#  a.append([int(x) for x in input().split()])
#p = [int(x) for x in input().split()]
#a.sort()
#print(l, file=sys.stderr)

# 文字列の入力
s = input()

# 出力
#print("{} {}".format(a+b+c, s))
#a.sort()
#print(set(a), file=sys.stderr)
#print(len(set(a)))

#cache = dict()

import re

def doit():
  l = len(set(list(s)))
  print(l, file=sys.stderr)
  if l == 4:
    return "Good"
  return "Bad"

#print(doit([0] * 4))
#doit(s)
#print(doit())
try:
  print(doit())
except Exception as e:
  print("e", e, file=sys.stderr)

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

Solution code:
def has_duplicates(s):
    return len(s) != len(set(s))

s=input()

if has_duplicates(s):
    print("Bad")
else:
    print("Good")

Submission status: Wrong Answer

Solution code:
N = input()
a = N[0]
b = N[1]
c = N[2]
d = N[3]
if a == b or a==c or a==d or b==c or b==d or c==d:
	print("Bad")
else:
	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:
S = input()

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

print("Good")