Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N = inputInt()
    A = inputList()
    
    b = []
    for i, val in enumerate(A):
        b.append(val)
        b = b[::-1]
        #print(*b)
    
    print(*b)
    
        
if __name__ == "__main__":
	main()


Fixed submission:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    N = inputInt()
    A = inputList()
    
    b = [0 for _ in range(N)]
    base = (N//2)
    cnt = 1
    
    flg = False
    if N % 2 == 0:
        flg = True
    
    for i, val in enumerate(A):
        
        if flg == True:
            if i == 0:
                b[base] = val
            elif i % 2 == 1:
                b[base-cnt] = val
            else:
                b[base+cnt] = val
                cnt+=1
        else:
            if i == 0:
                b[base] = val
            elif i % 2 == 1:
                b[base+cnt] = val
            else:
                b[base-cnt] = val
                cnt+=1
    
    print(*b)
    
        
if __name__ == "__main__":
	main()
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys

def main():
	N = int(input())
	
	btnList = []
	for _ in range(N):
		tmp = int(input())
		btnList.append(tmp)
	
	tugi = btnList[0]
	i = 1
	if tugi-1 == 1:
	print(i)
	sys.exit()
	while i < N+1:
		i += 1
		tugi = btnList[tugi-1]
		if tugi-1 == 1:
			print(i)
			sys.exit()
	print(-1)
	
if __name__ == "__main__":
	main()
	

Fixed submission:
# -*- coding: utf-8 -*-
import sys

def main():
	N = int(input())
	ai = [int(input()) for i in range(N)]
	
	now = 1
	count = 0
	for i in range(N):
		count = count + 1
		now = ai[now-1]
		if now == 2:
			print(count)
			exit()
	print(-1)
	
if __name__ == "__main__":
	main()

Buggy python submission (verdict: Runtime Error):
N = int(input())
    ai = [int(input()) for i in range(N)]
    
    now = 1
    count = 0
    for i in range(N):
        count = count + 1
        now = ai[now-1]
        if now == 2:
            print(count)
            exit()
    print(-1)

Fixed submission:
# -*- coding: utf-8 -*-
import sys

def main():
	N = int(input())
	ai = [int(input()) for i in range(N)]
	
	now = 1
	count = 0
	for i in range(N):
		count = count + 1
		now = ai[now-1]
		if now == 2:
			print(count)
			exit()
	print(-1)
	
if __name__ == "__main__":
	main()

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys

def main():
	N = int(input())
	
	btnList = []
	for _ in range(N):
		tmp = int(input())
		btnList.append(tmp)
	
	tugi = btnList[0]
	lists = [0]
	while True:
		lists.append(tugi-1)
		tugi = btnList[tugi-1]
		print(lists)
		if tugi-1 == 1:
			print(len(lists))
			sys.exit()
		if (tugi-1) in lists:
			print(-1)
			sys.exit()
	
if __name__ == "__main__":
	main()
	

Fixed submission:
# -*- coding: utf-8 -*-
import sys

def main():
	N = int(input())
	ai = [int(input()) for i in range(N)]
	
	now = 1
	count = 0
	for i in range(N):
		count = count + 1
		now = ai[now-1]
		if now == 2:
			print(count)
			exit()
	print(-1)
	
if __name__ == "__main__":
	main()
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    r,g,b = inputMap()
    
    tmp = str(r) + str(g) + str(b)
    tmp1 = int(tmp)
    
    if tmp % 4 == 0:
        print("YES")
    else:
        print("NO")
    
        
if __name__ == "__main__":
	main()


Fixed submission:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    r,g,b = inputMap()
    
    tmp = str(r) + str(g) + str(b)
    tmp1 = int(tmp)
    
    if tmp1 % 4 == 0:
        print("YES")
    else:
        print("NO")
    
        
if __name__ == "__main__":
	main()
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    A,B = inputMap()
    
    tmp = A+B
    
    if tmp < 11:
        print(tmp)
    else:
        print("error")
    
        
if __name__ == "__main__":
	main()


Fixed submission:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    S = list(input())
    
    tmp = {}
    for i in S:
        if i in tmp:
            print("no")
            sys.exit()
        else:
            tmp[i] = 1
            
    print("yes")
        
if __name__ == "__main__":
	main()
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    O = input()
    E = input()
    
    ans = ""
    for i,val in enumerate(O):
        ans += val
        ans += E[i]
        
    print(ans)
    
    
if __name__ == "__main__":
	main()


Fixed submission:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    O = input()
    E = input()
    
    tmp = len(E)
    ind = 0
    
    ans = ""
    for i,val in enumerate(O):
        ans += val
        ind = i
        if tmp > i:
            ans += E[i]
        
    print(ans)
    
    
if __name__ == "__main__":
	main()
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    a,b = inputMap()
    
    if a == "H":
        if b == "H":
            print("H")
        else:
            print("D")
    else:
        if b == "H":
            print("D")
        else:
            print("H")
    
    
if __name__ == "__main__":
	main()


Fixed submission:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    a,b = map(str, input().split())
    
    if a == "H":
        if b == "H":
            print("H")
        else:
            print("D")
    else:
        if b == "H":
            print("D")
        else:
            print("H")
    
    
if __name__ == "__main__":
	main()
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
import sys

def main():
	n = int(input())
	
	p = 1
	for i in range(1, n+1):
		p = p * i
		
	print(p % 1000000007)
	
if __name__ == "__main__":
	main()
	

Fixed submission:
# -*- coding: utf-8 -*-
import sys

def main():
	n = int(input())
	
	p = 1
	for i in range(1, n+1):
		p = (p * i) % 1000000007
		
	print(p)
	
if __name__ == "__main__":
	main()
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    c = input()
    an = [a,i,u,e,o]
    
    if c in an:
        print("vowel")
    else:
        print("consonant")
    
if __name__ == "__main__":
	main()


Fixed submission:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    c = input()
    an = ["a","i","u","e","o"]
    
    if c in an:
        print("vowel")
    else:
        print("consonant")
    
if __name__ == "__main__":
	main()
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    H,W = inputMap()
    C = []
    for i in range(H):
        c = inputList()
        C.append(c)
        
    for i in C:
        tmp = "".join(i)
        print(tmp)
        print(tmp)
    
if __name__ == "__main__":
	main()


Fixed submission:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    H,W = inputMap()
    C = []
    for i in range(H):
        c = input()
        C.append(c)
        
    for i in C:
        print(i)
        print(i)
    
if __name__ == "__main__":
	main()
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    W,H,N = inputMap()
    x_hidari = 0
    x_migi = W
    y_shita = 0
    y_ue = H
    
    for i in range(N):
        x,y,a = inputMap()
        
        if a == 1:
            if x_hidari < x:
                x_hidari = x
        elif a == 2:
            if x_migi > x:
                x_migi = x
        elif a == 3:
            if y_shita < y:
                y_shita = y
        else:
            if y_ue > y:
                y_ue = y
                
    #print("{} {} {} {}".format(x_hidari,x_migi,y_ue,y_shita))
    xxx = x_migi-x_hidari
    yyy = y_ue-y_shita
    if xxx < 0 or yyy < 0:
        print(0)
        sts.exit()
    
    print(xxx * yyy)
    
    
if __name__ == "__main__":
	main()


Fixed submission:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    W,H,N = inputMap()
    x_hidari = 0
    x_migi = W
    y_shita = 0
    y_ue = H
    
    for i in range(N):
        x,y,a = inputMap()
        
        if a == 1:
            if x_hidari < x:
                x_hidari = x
        elif a == 2:
            if x_migi > x:
                x_migi = x
        elif a == 3:
            if y_shita < y:
                y_shita = y
        else:
            if y_ue > y:
                y_ue = y
                
    #print("{} {} {} {}".format(x_hidari,x_migi,y_ue,y_shita))
    xxx = x_migi-x_hidari
    yyy = y_ue-y_shita
    if xxx < 0 or yyy < 0:
        print(0)
        sys.exit()
    
    print(xxx * yyy)
    
    
if __name__ == "__main__":
	main()
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys

def main():
	n = int(input())

	ins = []
	for _ in range(n):
		t, a = map(int, input().split(" "))
		ins.append((t, a))

	takahashi = 0
	aoki = 0
	takahashi, aoki = ins[0]

	for i, val in enumerate(ins):
		if i == 0: continue
		t, a = val
		m = max(-(-takahashi // t), -(-aoki // a))
		takahashi, aoki = t * m, a * m

	print(takahashi + aoki)

if __name__ == "__main__":
	main()


Fixed submission:
# -*- coding: utf-8 -*-
import sys

def main():
	a, b, c = map(int, input().split(" "))

	ans = 1
	if a != b:
		ans = ans + 1
	if a != c and b != c:
		ans = ans + 1

	print(ans)

if __name__ == "__main__":
	main()

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
import sys

def main():
	n = int(input())

	ins = []
	for _ in range(n):
		t, a = map(int, input().split(" "))
		ins.append((t, a))

	takahashi = 0
	aoki = 0
	takahashi, aoki = ins[0]

	for i, val in enumerate(ins):
		if i == 0: continue
		t, a = val
		m = max(-(-takahashi // t), -(-aoki // a))
		takahashi, aoki = t * m, a * m

	print(int(takahashi + aoki))

if __name__ == "__main__":
	main()


Fixed submission:
# -*- coding: utf-8 -*-
import sys

def main():
	a, b, c = map(int, input().split(" "))

	ans = 1
	if a != b:
		ans = ans + 1
	if a != c and b != c:
		ans = ans + 1

	print(ans)

if __name__ == "__main__":
	main()
Buggy python submission (verdict: Time Limit Exceeded):
x = int(input())
a, b = 0, 0
nx = 'a'
while True:
    if a ** 5 - b ** 5 == x:
        print('{} {}'.format(a, b))
        break
    if -a ** 5 - b ** 5 == x:
        print('{} {}'.format(-a, b))
        break
    if a ** 5 - (-b) ** 5 == x:
        print('{} {}'.format(a, -b))
        break
    if -a ** 5 - (-b) ** 5 == x:
        print('{} {}'.format(-a, -b))
        break
    if nx == 'a':
        a += 1
        nx = 'b'
    else:
        b += 1
        nx = 'a'


Fixed submission:
x = int(input())
for b in range(1000):
    for a in range(1000):
        if a ** 5 - b ** 5 == x:
            print('{} {}'.format(a, b))
            exit()
        if (-a) ** 5 - b ** 5 == x:
            print('{} {}'.format(-a, b))
            exit()
        if a ** 5 - (-b) ** 5 == x:
            print('{} {}'.format(a, -b))
            exit()
        if (-a) ** 5 - (-b) ** 5 == x:
            print('{} {}'.format(-a, -b))
            exit()

Buggy python submission (verdict: Time Limit Exceeded):
x = int(input())
a, b = 0, 0
nx = 'a'
while True:
    if a ** 5 - b ** 5 == x:
        print('{} {}'.format(a, b))
        break
    if -a ** 5 - b ** 5 == x:
        print('{} {}'.format(-a, b))
        break
    if a ** 5 - (-b) ** 5 == x:
        print('{} {}'.format(a, -b))
        break
    if -a ** 5 - (-b) ** 5 == x:
        print('{} {}'.format(-a, -b))
        break
    if nx == 'a':
        a += 1
        nx = 'b'
    else:
        b += 1
        nx = 'a'


Fixed submission:
x = int(input())
for b in range(1000):
    for a in range(1000):
        if a ** 5 - b ** 5 == x:
            print('{} {}'.format(a, b))
            exit()
        if (-a) ** 5 - b ** 5 == x:
            print('{} {}'.format(-a, b))
            exit()
        if a ** 5 - (-b) ** 5 == x:
            print('{} {}'.format(a, -b))
            exit()
        if (-a) ** 5 - (-b) ** 5 == x:
            print('{} {}'.format(-a, -b))
            exit()
Buggy python submission (verdict: Time Limit Exceeded):
s = input()
m = [0 for _ in range(2019)]
m[0] = 1
for i in range(len(s)):
    t = int(s[i:])
    m[t % 2019] += 1
print(sum([int(x * (x - 1) / 2) for x in m if x > 1]))


Fixed submission:
s = input()
s = s[::-1]
n = len(s)
m = [0] * 2019
m[0] = 1
a = 0
d = 1
for i in range(n):
    a = (a + int(s[i]) * d) % 2019
    d = (d * 10) % 2019
    m[a] += 1
print(sum([int(x * (x - 1) / 2) for x in m if x > 1]))

Buggy python submission (verdict: Time Limit Exceeded):
s = input()
m = {0: 0}
for i in range(len(s)):
    t = int(s[i:])
    a = t % 2019
    if a in m:
        m.update({a: m[a] + 1})
    else:
        m.update({a: 0})
ans = 0
for _, v in m.items():
    ans += v
print(ans)


Fixed submission:
s = input()
s = s[::-1]
n = len(s)
m = [0] * 2019
m[0] = 1
a = 0
d = 1
for i in range(n):
    a = (a + int(s[i]) * d) % 2019
    d = (d * 10) % 2019
    m[a] += 1
print(sum([int(x * (x - 1) / 2) for x in m if x > 1]))
Buggy python submission (verdict: Time Limit Exceeded):
s = input()
d = True
q = int(input())
for _ in range(q):
    a = input().split()
    if a[0] == '1':
        d = not d
    else:
        if a[1] == '1':
            if d:
                s = a[2] + s
            else:
                s = s + a[2]
        else:
            if d:
                s = s + a[2]
            else:
                s = a[2] + s

if not d:
    print(s[::-1])
else:
    print(s)


Fixed submission:
s = input()
d = True
f = '' # Front
b = '' # Back
q = int(input())
for _ in range(q):
    a = input().split()
    if a[0] == '1':
        d = not d
    else:
        if a[1] == '1':
            if d:
                f = ''.join([a[2], f])
            else:
                b = ''.join([b, a[2]])
        else:
            if d:
                b = ''.join([b, a[2]])
            else:
                f = ''.join([a[2], f])

if not d:
    print(''.join([b[::-1], s[::-1], f[::-1]]))
else:
    print(''.join([f, s, b]))

Buggy python submission (verdict: Time Limit Exceeded):
s = input()
q = int(input())
for _ in range(q):
    a = input().split()
    if a[0] == '1':
        s = s[::-1]
    else:
        if a[1] == '1':
            s = a[2] + s
        else:
            s = s + a[2]
print(s)


Fixed submission:
s = input()
d = True
f = '' # Front
b = '' # Back
q = int(input())
for _ in range(q):
    a = input().split()
    if a[0] == '1':
        d = not d
    else:
        if a[1] == '1':
            if d:
                f = ''.join([a[2], f])
            else:
                b = ''.join([b, a[2]])
        else:
            if d:
                b = ''.join([b, a[2]])
            else:
                f = ''.join([a[2], f])

if not d:
    print(''.join([b[::-1], s[::-1], f[::-1]]))
else:
    print(''.join([f, s, b]))
Buggy python submission (verdict: Runtime Error):
x = int(input())
return "Yes" if x >= 30 else "No"

Fixed submission:
x = int(input())
a = "Yes" if x >= 30 else "No"
print(a)
Buggy python submission (verdict: Runtime Error):
N = int(input())
 
nums = []
sum = 0
for i in range(0,N):
    num = input()
    if num in nums:
        nums.remove(num)
        sum -= 1
    else:
        nums.append(num)
        sum +=  1
print(sum)

Fixed submission:
N = int(input())

if N >= 90:
    print("Yes")
elif (N+1)%10 is 0:
    print("Yes")
else:
     print("No")

Buggy python submission (verdict: Runtime Error):
N = int(input())

nums = []
sum = 0
for i in range(0,N):
    num = input()
    if num in nums:
        nums.remove(num)
    else:
        nums.append(num)
        sum = sum + 1
print(sum)

Fixed submission:
N = int(input())

if N >= 90:
    print("Yes")
elif (N+1)%10 is 0:
    print("Yes")
else:
     print("No")

Buggy python submission (verdict: Runtime Error):
N = int(input())
if N >= 90 or (N+1)%10 is 0:
        print("Yes")
    else:
        print("No")

Fixed submission:
N = int(input())

if N >= 90:
    print("Yes")
elif (N+1)%10 is 0:
    print("Yes")
else:
     print("No")

Buggy python submission (verdict: Runtime Error):
N = input()
if N >= 90:
    print("Yes")
elif (N+1)%10 is 0:
    print("Yes")
else:
    print("No")

Fixed submission:
N = int(input())

if N >= 90:
    print("Yes")
elif (N+1)%10 is 0:
    print("Yes")
else:
     print("No")

Buggy python submission (verdict: Runtime Error):
if N >= 90:
    print("Yes")
elif (N+1)%10 is 0:
    print("Yes")
else:
    print("No")

Fixed submission:
N = int(input())

if N >= 90:
    print("Yes")
elif (N+1)%10 is 0:
    print("Yes")
else:
     print("No")