Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import sys

if __name__=="__main__":
    ab=[]
    cd=[]
    [n,m]=map(int,raw_input().split(" "))
    for i in range(n):
        ab.append( map(int,raw_input().split(" ")) )
    for j in range(m):
        cd.append( map(int,raw_input().split(" ")) )
    for i in range(n):
        min=sys.maxint
        index=0
        for j in range(m):
            distance = abs(ab[i][0]-cd[j][0])+abs(ab[i][1]-cd[j][1])
            if min > distance :
                min=distance 
                index=j
        print(index+1)


Fixed submission:
print(sum(map(int,raw_input().split()))%24)

Buggy python submission (verdict: Runtime Error):
import sys

if __name__=="__main__":
    ab=[]
    cd=[]
    [n,m]=map(int,raw_input().split(" "))
    for i in range(n):
        ab.append( map(int,raw_input().split(" ")) )
    for j in range(m):
        cd.append( map(int,raw_input().split(" ")) )
    for i in range(n):
        min=sys.maxint
        index=0
        for j in range(m):
            distance = abs(ab[i][0]-cd[j][0])+abs(ab[i][1]-cd[j][1])
            if min > distance :
                min=distance 
                index=j
        print(index+1)


Fixed submission:
print(sum(map(int,raw_input().split()))%24)

Buggy python submission (verdict: Runtime Error):
print(sum(map(int,raw_input().split()))%24)

Fixed submission:
print(sum(map(int,raw_input().split()))%24)
Buggy python submission (verdict: Runtime Error):
def keta(a):
    count=1
    while a>=10:
        a/=10
        count+=1
    return count

stac=[]
N=int(input())
for i in range(1,int(N/2+1)):
    if N%i==0:
        j=int(N/i)
        stac.append(max(keta(i),keta(j)))

print(min(stac))

Fixed submission:
import math

def keta(a):
    count=1
    while a>=10:
        a/=10
        count+=1
    return count


N=int(input())
mi=10
for i in range(1,int(N/math.sqrt(N)+1)):
    if N%i==0:
        j=int(N/i)
        if mi>max(keta(i),keta(j)):
            mi=max(keta(i),keta(j))

print(mi)

Buggy python submission (verdict: Runtime Error):

import math

n = int(raw_input())

i = 1
# sqn = math.ceil(math.sqrt(n))

while math.sqrt(n) > i:
    if n % i == 0:
        ans = n / i
        #ans = int(math.log10(n / i)) + 1
    i += 1
print len(str(ans))#(ans)

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

import math

n = int(raw_input())

i = 1
# sqn = math.ceil(math.sqrt(n))

while i * i <= n:
    if n % i == 0:
        ans = n / i
        #ans = int(math.log10(n / i)) + 1
    i += 1
print len(str(ans))#(ans)

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

import math

n = int(raw_input())

i = 1
# sqn = math.ceil(math.sqrt(n))

while math.sqrt(n) > i:
    if n % i == 0:
        ans = n / i
        ans = int(math.log10(n / i)) + 1
    i += 1
print len(str(ans))#(ans)

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

import math

n = int(raw_input())

i = 1
# sqn = math.ceil(math.sqrt(n))

while i * i <= n:
    if n % i == 0:
        ans = n / i
        #ans = int(math.log10(n / i)) + 1
    i += 1
print len(str(ans))#(ans)

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

import math

n = int(raw_input())

i = 1
sqn = math.ceil(math.sqrt(n))

while math.sqrt(n) > i:
    if n % i == 0:
        ans = int(math.log10(n / i)) + 1
    i += 1
print(ans)

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

import math

n = int(raw_input())

i = 1
# sqn = math.ceil(math.sqrt(n))

while i * i <= n:
    if n % i == 0:
        ans = n / i
        #ans = int(math.log10(n / i)) + 1
    i += 1
print len(str(ans))#(ans)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

X= int(raw_input().split())

a = 0
while X >0:
    a += 1
    X -= a
print a

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

X= int(raw_input())

a = 0
while X >0:
    a += 1
    X -= a
print a

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

X= map(int,raw_input().split())

a = 0
while X >0:
    a += 1
    X -= a
print a

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

X= int(raw_input())

a = 0
while X >0:
    a += 1
    X -= a
print a
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-

n = int(raw_input())

power = 1

for i in range(n):
    power *= (i+1)

print(power%(10**9 + 7))

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

n = int(raw_input())

power = 1
m = 10**9 + 7

for i in range(n):
    power *= (i+1)
    power %= m

print(power)
Buggy python submission (verdict: Runtime Error):
#include <stdio.h>

int abs(int j)
{
    return (j>0) ? j : -j;
}

int main()
{
    int N, M, i, j;
    int a[50], b[50], c[50], d[50],;
    int p[50] = {0};

    scanf("%d %d", &N, &M);
    
    for(i=0; i<N; i++)
    {
         scanf("%d %d", &a[i], &b[i]);
    }
    
    for(j=0; j<M; j++)
    {
         scanf("%d %d", &c[j], &d[j]);
    }
    
    for(i=0; i<N; i++)
    {
         for(j=0; j<M; j++)
         {
             if(abs(a[i] - c[j]) + abs(b[i] - d[j]) < abs(a[i] - c[p[i]]) + abs(b[i] - d[p[i]])
             {
                 p[i] = j;
             }
         }
         printf("%d\n", p[i]);
    }
}

Fixed submission:
L = [int(i) for i in input().split(' ')]
print((L[0] + L[1]) % 24)

Buggy python submission (verdict: Runtime Error):
l = map(int, input().split())
print((l[0] + l[1]) % 24)

Fixed submission:
L = [int(i) for i in input().split(' ')]
print((L[0] + L[1]) % 24)

Buggy python submission (verdict: Runtime Error):
l = map(int, raw_input().split())
print((l[0] + l[1]) % 24)

Fixed submission:
L = [int(i) for i in input().split(' ')]
print((L[0] + L[1]) % 24)

Buggy python submission (verdict: Runtime Error):
def distance(p1,p2):
    return abs(p1[0]-p2[0])+abs(p1[1]-p2[1])

M,N=[int(x) for x in input().split()]

student=[]
check=[]
for i in range(0,M):
    a,b=[int(x) for x in input().split()]
    student.append((a,b))

for j in range(0,N):
    c,d=[int(x) for x in input().split()]
    check.append((c,d))


for i in range(0,M):
    dist=distance(student[i],check[N-1])
    num=N-1
    for j in range(0,N):
        k=N-j-1
        if dist>=distance(student[i],check[k]):
            dist=distance(student[i],check[k])
            num=k
    print(num+1)


Fixed submission:
A,B=[int(x) for x in input().split()]
print((A+B)%24)
Buggy python submission (verdict: Runtime Error):
from itertools import combinations

N,T=[int(x) for x in input().split()]
towns=list([int(x) for x in input().split()])

com=combinations(list(range(0,N)),2)

bene=[]
for c in com:
    bene.append(towns[c[1]]-towns[c[0]])

max_bene=max(bene)
print(len([item for item in [x for x in bene if x==max_bene]]))

Fixed submission:
candies=[int(x) for x in input().split()]
candies.sort()
if candies[2]==(candies[0]+candies[1]):
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
print(len(re.sub("B+","B",re.sub("W+","W",input())))-1)


Fixed submission:
candies=[int(x) for x in input().split()]
candies.sort()
if candies[2]==(candies[0]+candies[1]):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import re
print(len(re.sub("B+","B",re.sub("W+","W",S)))-1)


Fixed submission:
S=list(input())

def transform(S):
    r_S=[S[0]]
    now_c=S[0]
    for item in S:
        if now_c==item:
            pass
        else:
            now_c=item
            r_S.append(item)

    return r_S

print(len(transform(S))-1)
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
C = A + B 
if C >= 24:
    C -= 24
print(C)


Fixed submission:
AB = input()
if len(AB) <= 2:
    ABL = [AB]
else:
    ABL= AB.replace("\n", " ").split(" ")



A = int(ABL[0])
if len(AB) <= 2:
    C = A
else:
    B = ABL[1]
    C = int(A) + int(B )
    
if C >= 24:
    C -= 24
print(C)

Buggy python submission (verdict: Runtime Error):
import math
def digit(X):
    d = 0
    while X:
        X //= 10
        d += 1
    return d

def F(A, B):
    return max(digit(A), digit(B))

N = int(input())

min_F = 20
max_div = round(math.sqrt(N))
for i in range(1, max_div):
    if N % i == 0:
        f = F(i, N/i)
        if f < min_F:
            min_F = f
print(min_F)



Fixed submission:
A, B = map(int, input().split())
print((A + B) % 24)
Buggy python submission (verdict: Runtime Error):
# -*- coding:utf-8 -*-
n = int(input())

r = int(n/15
print(n*800-r*200)


Fixed submission:
# -*- coding:utf-8 -*-
n = int(input())

r = int(n/15)
print(n*800-r*200)
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding:utf-8 -*-
n = int(input())

p = 1
for i in range(n):
    p *= (i+1)
o = p%(10**9+7)
print(o)


Fixed submission:
# -*- coding:utf-8 -*-
n = int(input())

p = 1
for i in range(n):
    p = (p * (i+1))%1000000007
print(p)
Buggy python submission (verdict: Runtime Error):
# -*- coding:utf-8 -*-
from operator import itemgetter
n = int(raw_input())
a = [[int(k),i+1] for i,k in enumerate(raw_input().split())]
a.sort(key=itemgetter(0),reverse=True)
s = []
b = []
a.append([0,0])
for i,p in enumerate(a[:-1]):
    if not p[0] == a[i+1][0]:
        q = a[i][0] - a[i+1][0]
        y = [z[1] for z in a[:i+1]]
        s.extend([min(y)]*(i+1)*q)

for i in xrange(1,int(n)+1):
    print(s.count(i))


Fixed submission:
# -*- coding:utf-8 -*-
n,m = map(int, raw_input().split())

l = (n*2+m)/4

answer = l if l>= n else min(n,m/2)
print(answer)
Buggy python submission (verdict: Runtime Error):
a, op, b = input().split()
if op = '+':
    print(int(a) + int(b))
else:
    print(int(a) - int(b))

Fixed submission:
a, op, b = input().split()
if op == '+':
    print(int(a) + int(b))
else:
    print(int(a) - int(b))
Buggy python submission (verdict: Runtime Error):
#coding: shift_jis
N = int(raw_input())
S = raw_input()
x = 0
y = [x]
for i in range(N-1):
    if S[i] == 'I':
        x += 1
    elif S[i] == 'D':
        x -= 1
    y.append(x)
print max(y)

Fixed submission:
#coding: shift_jis

A,B,C,D = map(int,raw_input().split())

if A*B > C*D:
    print A*B
elif A*B < C*D:
    print C*D
else:
    print A*B

Buggy python submission (verdict: Runtime Error):
#coding: shift_jis


N = int(raw_input())
S = raw_input()
x = 0
y = [x]
for i in range(N-1):
    if S[i] == 'I':
        x += 1
    elif S[i] == 'D':
        x -= 1
    y.append(x)
print max(y)

Fixed submission:
#coding: shift_jis

A,B,C,D = map(int,raw_input().split())

if A*B > C*D:
    print A*B
elif A*B < C*D:
    print C*D
else:
    print A*B
Buggy python submission (verdict: Runtime Error):
#coding: shift_jis


N = int(raw_input())
S = raw_input()
x = 0
y = [x]
for i in range(N):
    if S[i] == 'I':
        x += 1
    elif S[i] == 'D':
        x -= 1
    y.append(x)
print max(y)



    



  
    
    

    
    
#coding: shift_jis


N = int(raw_input())
S = raw_input()
x = 0
y = [x]
for i in range(N):
    if S[i] == 'I':
        x += 1
    elif S[i] == 'D':
        x -= 1
    y.append(x)
print max(y)



  

Fixed submission:
#coding: shift_jis


N = int(raw_input())
S = raw_input()
x = 0
y = [x]
for i in range(N):
    if S[i] == 'I':
        x += 1
    elif S[i] == 'D':
        x -= 1
    y.append(x)
print max(y)
Buggy python submission (verdict: Runtime Error):
X = int(input())
dist = [0]
prev_dist = [0]
time = 0
while not X in dist:
    time += 1
    for i in prev_dist:
        if not i+time in dist: dist.append(i+time)
        if not i-time in dist: dist.append(i-time)
    prev_dist = dist[:]
print(time)

Fixed submission:
key = tuple(input().split())
table = {("H", "H"): "H", ("H", "D"): "D",
         ("D", "H"): "D", ("D", "D"): "H"}
print(table[key])
Buggy python submission (verdict: Time Limit Exceeded):
X = int(input())
L = [sum(range(i+1)) for i in range(X+1) if sum(range(i+1))<X]
print(len(L))

Fixed submission:
X = int(input())
for i in range(X+1):
    if (i*(i+1)/2) >= X:
        time = i
        break
print(time)

Buggy python submission (verdict: Time Limit Exceeded):
X = int(input())
time = 0
while True:
    if sum(range(time+1)) >= X:
        break
    time+=1
print(time)

Fixed submission:
X = int(input())
for i in range(X+1):
    if (i*(i+1)/2) >= X:
        time = i
        break
print(time)

Buggy python submission (verdict: Time Limit Exceeded):
X = int(input())
dist = [0]
prev_dist = [0]
time = 0
while not X in dist:
    time += 1
    for i in prev_dist:
        if not i+time in dist: dist.append(i+time)
        if not i-time in dist: dist.append(i-time)
    prev_dist = dist[:]
print(time)

Fixed submission:
X = int(input())
for i in range(X+1):
    if (i*(i+1)/2) >= X:
        time = i
        break
print(time)
Buggy python submission (verdict: Runtime Error):
a, b=map(str,input().split())
if(a=="H"):
	print(b)
else:
	if(b=="H"):
		print(D)
	else:
		print(H)


Fixed submission:
a, b=map(str,input().split())
if(a=="H"):
	print(b)
else:
	if(b=="H"):
		print("D")
	else:
		print("H")

Buggy python submission (verdict: Runtime Error):
a, b=map(str,input().split())
if(a=='H'):
	print(b)
else:
	if(b=='H'):
		print(D)
	else:
		print(H)

Fixed submission:
a, b=map(str,input().split())
if(a=="H"):
	print(b)
else:
	if(b=="H"):
		print("D")
	else:
		print("H")

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

a, b = map(str, raw_input().split())
result = ''
if a == ‘H’:
	if b== ‘H’:
		result = ‘H’
	else:
		result = ‘D’
else:
	if b==‘H’
		result=‘D’
	else:
		result=‘H'

# 出力
print result

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

a, b = map(str, raw_input().split())
result = ''
if a == 'H':
    if b== 'H':
       	result = 'H'
    else:
	result = 'D'
else:
    if b=='H':
        result='D'
    else:
	result='H'

# 出力
print result
Buggy python submission (verdict: Time Limit Exceeded):
num = int(raw_input())
array = map(int, raw_input().split(" "))

all_ok = True
if num % 2 == 0:
    for i in range(num / 2):
        n = i * 2 + 1
        if n in array and ( array.count(n) == 2 ):
            continue
        else:
            all_ok = False
            break
else:
    for i in range(num / 2 + 1):
        n = i * 2
        if n == 0:
            if n in array and (array.count(n) == 1):
                continue
            else:
                all_ok = False
                break
        else:
            if n in array and ( array.count(n) == 2 ):
                continue
            else:
                all_ok = False
                break


div = pow(10, 9) + 7
if all_ok:
    print pow(2, (num/2) ) % div
else:
    print 0


Fixed submission:
num = int(raw_input())
array = map(int, raw_input().split(" "))

a = sorted(array)

if num % 2 == 0:
    for i in xrange(0, num, 2):
        if a[i] != a[i + 1]:
            print 0
            break
    else:
        div = pow(10, 9) + 7
        print pow(2, num / 2) % div
else:
    for i in xrange(1, num, 2):
        if a[i] != a[i + 1]:
            print 0
            break
    else:
        div = pow(10, 9) + 7
        print pow(2, num / 2) % div

Buggy python submission (verdict: Time Limit Exceeded):
num = int(raw_input())
array = raw_input().split(" ")

array_list = list(set(array[:]))
contain = []
if num % 2 == 0:
    for i in range(num / 2):
        contain.append(i * 2 + 1)
else:
    for i in range(num / 2 + 1):
        contain.append(i * 2)

all_ok = True
for i in range(len(array)):

    if int(array[i]) in contain:
        if (int(array[i]) == 0 and array.count(array[i]) == 1):
            continue
        elif (int(array[i]) != 0 and array.count(array[i]) == 2):
            continue
        else:
            all_ok = False
            break
    else:
        all_ok = False
        break

div = pow(10, 9) + 7
if all_ok:
    print pow(2, (num/2) ) % div
else:
    print 0


Fixed submission:
num = int(raw_input())
array = map(int, raw_input().split(" "))

a = sorted(array)

if num % 2 == 0:
    for i in xrange(0, num, 2):
        if a[i] != a[i + 1]:
            print 0
            break
    else:
        div = pow(10, 9) + 7
        print pow(2, num / 2) % div
else:
    for i in xrange(1, num, 2):
        if a[i] != a[i + 1]:
            print 0
            break
    else:
        div = pow(10, 9) + 7
        print pow(2, num / 2) % div
Buggy python submission (verdict: Time Limit Exceeded):
X = int(input())
s = t = 0
while s < X:
    s = 0
    t += 1
    for i in range(t+1):
        s += i
print(t)


Fixed submission:
X = int(input())
s = 0
for t in range(10**9):
    if s >= X:
        print(t-1)
        break
    s += t
Buggy python submission (verdict: Time Limit Exceeded):
X = int(input())

possible_locations = [0]
previous_point = 0

for i in range(100000000):
    length = i + 1

    possible_locations_previous = possible_locations[:]
    for start_from in possible_locations_previous:
        new_points = [start_from, start_from + length ,start_from - length]
        possible_locations += new_points

    possible_locations = list(set(possible_locations))

    if X in possible_locations:
        print(i+1)
        break


Fixed submission:
X = int(input())
previous = 0 
for i in range(100000):
    previous += i 
    if X <= previous:
        print(i)
        break
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np

N = int(raw_input())
A = map(lambda x:int(x), raw_input().split())

A.sort()

A = np.asarray(A)
S = np.zeros_like(A)
s=0
for i in range(N):
    s += A[i]
    S[i] = s

F = np.ones(N, np.int)
for i in range(N):
    FLAG = False
    for j in range(i,N-1):
        if 2*S[j] < A[j+1]:
            FLAG=True
            break
    if FLAG:
        F[i] = 0
    else:
        break

print F.sum()

Fixed submission:
import numpy as np

N = int(raw_input())
A = map(lambda x:int(x), raw_input().split())

A.sort()

A = np.asarray(A)
S = np.zeros_like(A)
s=0
for i in range(N):
    s += A[i]
    S[i] = s

#print A
#print S
index = np.where(A[1:] - S[:-1]*2 > 0)[0]
if index.shape[0]:
    print N - index[-1]-1
else:
    print N

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np

N = int(raw_input())
A = map(lambda x:int(x), raw_input().split())

C = range(N)
A.sort()

A = np.asarray(A)
S = np.zeros_like(A)
s=0
for i in range(N):
    s += A[i]
    S[i] = s

F = np.ones(N, np.int)
for i in range(N):
    FLAG = False
    for j in range(i,N-1):
        if 2*S[j] < A[j+1]:
            FLAG=True
            break
    if FLAG:
        F[i] = 0

print F.sum()

Fixed submission:
import numpy as np

N = int(raw_input())
A = map(lambda x:int(x), raw_input().split())

A.sort()

A = np.asarray(A)
S = np.zeros_like(A)
s=0
for i in range(N):
    s += A[i]
    S[i] = s

#print A
#print S
index = np.where(A[1:] - S[:-1]*2 > 0)[0]
if index.shape[0]:
    print N - index[-1]-1
else:
    print N
Buggy python submission (verdict: Time Limit Exceeded):
import math
N=input()
r=math.factorial(N)
print r%(10**9+7)

Fixed submission:
N=input()
 
r=1
for i in xrange(N):
    r=r*(i+1)
    r=r%(10**9 + 7)
 
print r

Buggy python submission (verdict: Time Limit Exceeded):
N=input()

r=1
for i in xrange(N):
    r=r*(i+1)

print r%(10**9 + 7)


Fixed submission:
N=input()
 
r=1
for i in xrange(N):
    r=r*(i+1)
    r=r%(10**9 + 7)
 
print r
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
import numpy as np
N,T=map(int,raw_input().split())
A=map(int,raw_input().split())

arrmaxv=[]
arrmaxc=[]
for i in xrange(N-1):
    a=A[i:]
    maxv=max(a)
    maxc=a.count(maxv)
    arrmaxv.append((maxv-A[i]))
    arrmaxc.append(maxc)

maxv=np.array(arrmaxv)
maxc=np.array(arrmaxc)
idx=np.argwhere(maxv==np.max(maxv))
cnt=maxc[idx]
print(np.sum(cnt))


Fixed submission:
# -*- coding: utf-8 -*-
N,T=map(int,raw_input().split())
A=map(int,raw_input().split())

minv=A[0]
interval=0
cnt=0
for i in A[1:]:
    if i < minv:
        minv=i
    if i-minv > interval:
        interval=i-minv
        cnt=1
    elif i-minv == interval:
        cnt=cnt+1
print(cnt)
Buggy python submission (verdict: Runtime Error):
a =map(int,input())
s=0
for i in range(a[0]+1):
    s+=i
print(s)

Fixed submission:
a =int(input())
s=0
for i in range(a+1):
    s+=i
print(s)

Buggy python submission (verdict: Runtime Error):
a =map(int,input())
s=0
for i in range(a+1):
    s+=i
print(s)

Fixed submission:
a =int(input())
s=0
for i in range(a+1):
    s+=i
print(s)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if a*b<=0:
    print(Zero)
elif a<0 and (b-a)%2==0:
    print(Positive)
else:
    print(Negative)

Fixed submission:
a,b = map(int,input().split())
if a*b<=0:
    print("Zero")
elif a<0 and (b-a)%2==0:
    print("Negative")
else:
    print("Positive")

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if(a*b<=0):
    print(Zero)
elif(a<0 and (b-a)%2==0):
    print(Positive)
else:
    print(Negative)

Fixed submission:
a,b = map(int,input().split())
if a*b<=0:
    print("Zero")
elif a<0 and (b-a)%2==0:
    print("Negative")
else:
    print("Positive")

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if(a*b<=0)
    print(Zero)
elif(a<0 and (b-a)%2==0)
    print(Positive)
else
    print(Negative)

Fixed submission:
a,b = map(int,input().split())
if a*b<=0:
    print("Zero")
elif a<0 and (b-a)%2==0:
    print("Negative")
else:
    print("Positive")

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if(a*b<=0)
	print(Zero)
elif(a<0 and (b-a)%2==0)
	print(Positive)
else
	print(Negative)

Fixed submission:
a,b = map(int,input().split())
if a*b<=0:
    print("Zero")
elif a<0 and (b-a)%2==0:
    print("Negative")
else:
    print("Positive")

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if(a*b<=0)print(Zero)
elif(a<0 and (b-a)%2==0)
	print(Positive)
else
	print(Negative)

Fixed submission:
a,b = map(int,input().split())
if a*b<=0:
    print("Zero")
elif a<0 and (b-a)%2==0:
    print("Negative")
else:
    print("Positive")

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if(a*b<=0)print(Zero)
elif(a<0 and (b-a)%2==0)
	print(Positive)
else
	print(Negative)

Fixed submission:
a,b = map(int,input().split())
if a*b<=0:
    print("Zero")
elif a<0 and (b-a)%2==0:
    print("Negative")
else:
    print("Positive")

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if(a*b<=0)print(Zero)
elif(a<0 and b-a%2==0)
	print(Positive)
else
	print(Negative)

Fixed submission:
a,b = map(int,input().split())
if a*b<=0:
    print("Zero")
elif a<0 and (b-a)%2==0:
    print("Negative")
else:
    print("Positive")

Buggy python submission (verdict: Runtime Error):
a,b = map(int,inout().split())
if(a*b<=0)print(Zero)
elif(a<0 and b-a%2==0)
	print(Positive)
else
	print(Negative)

Fixed submission:
a,b = map(int,input().split())
if a*b<=0:
    print("Zero")
elif a<0 and (b-a)%2==0:
    print("Negative")
else:
    print("Positive")