Problem:


Problem Statement

You are given two integers a and b (a≤b). Determine if the product of the integers a, a+1, …, b is positive, negative or zero.

Constraints

a and b are integers.

-10^9≤a≤b≤10^9

Partial Score

In test cases worth 100 points, -10≤a≤b≤10.

Input

The input is given from Standard Input in the following format:

a b

Output

If the product is positive, print Positive. If it is negative, print Negative. If it is zero, print Zero.

Sample Input 1

1 3

Sample Output 1

Positive

1×2×3=6 is positive.

Sample Input 2

-3 -1

Sample Output 2

Negative

(-3)×(-2)×(-1)=-6 is negative.

Sample Input 3

-1 1

Sample Output 3

Zero

(-1)×0×1=0.



Sample input:
1 3


Sample output:
Positive

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a<=0 and b>=0:
    print("Zero")
    exit()
if a>0:
    print("Positive")
    exit()
tmp=0
for i in range(a,b+1):
    tmp+=1
if tmp%2==0:
    print("Positive")
else:
    print("Negative")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if 0 < a <= b:
    print("Positive")
elif a <= b < 0:
    if (b-a+1) % 2 == 0:
        print("Positive") 
    else:
        print("Negative")
else:
    print("Zero")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if (a<=0 and b>=0) or (b<=0 and a>=0):
    print("Zero")
elif a>0 and b>0:
    print("Positive")
else:
    if (b-a)%2==1:
        print("Positive")
    else:
        print("Negative")

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
if A<=0 and 0<=B:
    print('Zero')
elif A+B<0 and (A+B)%2==0:
    print('Negative')
else:
    print('Positive')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a==0 or b==0:
    print('Zero')
elif a>0 and b>0:
  print('Positive')
elif a<0 and b>0:
  print('Zero')
elif a<0 and b<0:
  if (b-a)%2==0:
    print('Negative')
  else:
    print('Positive')

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
mafs = 0 
if a < 1 and b >=0:
  print("Zero")
elif a > 0 and b > 0:
  print("Positive")
elif a < 0 and b < 0:
    if (abs(a) - abs(b) + 1) % 2 == 0: print("Positive")
    else: print("Negative")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
ans = ''
if a > 0 and b > 0:
  ans = 'Positive'
elif a <= 0 and b >= 0:
  ans = 'Zero'
elif a < 0 and  b < 0:
  if (b - a) % 2 == 0:
    ans = 'Negative'
  else:
    ans = 'Positive'
print(ans)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if 0 < a:
    print("Positive")
elif a == 0 or 0 <= b:
    print("Zero")
else:
    length = abs(a + b + 1)
    if length % 2 == 0:
        print("Positive")
    else:
        print("Negative")

Submission status: Accepted

Solution code:
from math import fabs
a, b = map(int, input().split())
if a <= 0 and 0 <= b:
    print("Zero")
else:
    if a > 0:
        print("Positive")
    else:
        if (fabs(b - a) + 1) % 2 == 0:
            print("Positive")
        else:
            print("Negative")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a*b<=0:
  ans='Zero'
elif a>0 and b>0:
  ans='Positive'
elif abs(a-b)%2!=0 :
  ans='Positive'
else:
  ans='Negative'
print(ans)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if (a<=0)&(b>=0):
    print("Zero")
elif(a>0)&(b>0):
    print("Positive")
else:
    if (b-a+1)%2==0:
        print("Positive")
    else:
        print("Negative")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
ans = "Positive"

if b < 0:
    if (b-a+1) % 2 != 0:
        ans = "Negative"
    
if a * b <= 0:
    ans = "Zero"
    
print(ans)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a > 0:
  print("Positive")
elif b<0:
  if((b-a)%2 == 0):
    print("Negative")
  else:
    print("Positive")
else:
  print("Zero")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a> 0:
  print("Positive")
elif b< 0 :
  if (b-a) % 2 == 0:
    print("Negative")
  else :
    print("Positive")
else : 
  print("Zero")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a > 0 :
  print("Positive")
elif b < 0 :
  if (b - a) % 2 == 0 :
      print("Negative")
  else:
      print("Positive")
else:
   print("Zero")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a>=0 and b>=0:
    print('Positive')
elif 0>b:
    if (b-a+1)%2==0:print('Positive')
    else:print('Negative')
elif a<=0<=b:
    print('Zero')
else:
    pass

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a > 0:
  print("Positive")
elif b<0:
  if((b-a)%2 == 0):
    print("Negative")
  else:
    print("Positive")
else:
  print("Zero")

Submission status: Accepted

Solution code:
def resolve():
    a, b = [int(i) for i in input().split()]
    if a <= 0 and 0 <= b:
        print("Zero")
    else:
        if a > 0:
            print("Positive")
        else:
            if (abs(b - a) + 1) % 2 == 0:
                print("Positive")
            else:
                print("Negative")


resolve()

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if 0<a<=b:
    print("Positive")
elif a<=b<0:
    if (b-a+1)%2==0:
        print("Positive")
    else:
        print("Negative")
else:
    print("Zero")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
ans = 1

if a > 0 and b > 0:
    print("Positive")
elif a == 0:
    print("Zero")
elif a < 0 and b > 0:
    print("Zero")
elif b == 0:
    print("Zero")
elif a < 0 and b < 0:
    diff = b - a
    if diff % 2 == 0:
        print("Negative")
    elif diff % 2 != 0:
        print("Positive")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


def read():
    a, b = map(int, input().strip().split())
    return a, b


def solve(a, b):
    if a <= 0 and 0 <= b:
        return "Zero"
    minus = 0
    if b < 0:
        minus = abs(b - a) + 1
    return "Positive" if minus % 2 == 0 else "Negative"


if __name__ == '__main__':
    inputs = read()
    print("%s" % solve(*inputs))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

def f(a, b):
    if a <= 0 <= b:
        return 0
    if a > 0:
        return 1
    b = min(b, -1)
    n = b - a + 1
    return (-1) ** n

words = ['Zero', 'Positive', 'Negative']
print(words[f(a, b)])

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a > 0:
  ans  = "Positive"
elif a == 0:
  ans = "Zero"
elif b >= 0:
  ans = "Zero"
else:
  if abs(a-b)%2 == 0:
    ans = "Negative"
  else:
    ans = "Positive"
print(ans)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a > 0:
    print('Positive')
elif a <= 0 and b >= 0:
    print('Zero')
else:
    if (b-a)%2 == 0:
        print('Negative')
    else:
        print('Positive')

Submission status: Accepted

Solution code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

a,b = i2()
if a > 0:
	print("Positive")
elif a <= 0 and 0 <= b:
	print("Zero")
else:
	if (b - a)%2 == 0:
		print("Negative")
	else:
		print("Positive")

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

a, b = map(int, read().split())

def f(a, b):
    if a <= 0 <= b:
        return 0
    if a > 0:
        return 1
    b = min(b, -1)
    n = b - a + 1
    return (-1) ** n

words = ['Zero', 'Positive', 'Negative']
print(words[f(a, b)])

Submission status: Accepted

Solution code:
a, b = map(int, input().split())


def f(x):
    if x < 0:
        return -1
    elif x > 0:
        return 1
    else:
        return 0


if f(a) == 0 or f(b) == 0:
    ans = "Zero"
elif f(a) == -1 and f(b) == -1:
    diff = b - a
    if (diff + 1) % 2 == 0:
        ans = "Positive"
    else:
        ans = "Negative"
elif f(a) == 1 and f(b) == 1:
    ans = "Positive"
else:
    ans = "Zero"

print(ans)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

a_pulus = a >= 0
b_pulus = b >= 0
a_minus = a < 0
b_minus = b < 0

if a_pulus & b_pulus:
    print("Positive")
elif a_minus & b_pulus:
    print("Zero")
else:
    if (b - a + 1) % 2 == 0:
        print("Positive")
    else:
        print("Negative")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a < 0 and b >= 0:
    ans = 'Zero'
elif a < 0 and b < 0 and abs(a-b) % 2 == 0:
    ans = 'Negative'
else:
    ans = 'Positive'

print(ans)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a>0 and b>0 :
    print("Positive")
elif a<0 and b<0 :
    t = abs(a)-abs(b)+1 
    if t%2 == 0 :
        print("Positive")
    else :
        print("Negative")
else:
    print("Zero")

Submission status: Accepted

Solution code:
#

import sys
from copy import deepcopy
input=sys.stdin.readline

def main():
    a,b=map(int,input().split())
    if a*b<=0:
        print("Zero")
    elif a>0:
        print("Positive")
    else:
        pm=(b-a+1)
        if pm%2==0:
            print("Positive")
        else:
            print("Negative")
    
if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    b = 1

    if a[0]<= 0 and a[1]>=0:
        b=0
    elif a[1]<0:
        c = abs(a[0]-a[1])
        if c %2 ==0:
            b=-1


    if b >0:
        print("Positive")
    elif b ==0:
        print("Zero")
    else:
        print("Negative")

Submission status: Accepted

Solution code:
a, b = map(int,input().split())
if a <= 0 and b >= 0:
    print('Zero')
else:
    if a < 0:
        if (min(b+1, 0)-a)%2==0:
            print('Positive')
        else:
            print('Negative')

    else:
        print('Positive')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
K=1
if a>0:
    print('Positive')
elif a<=0 and b>=0:
    print('Zero')
elif (b-a)%2==0:
    print('Negative')
else:
    print('Positive')

Submission status: Accepted

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

# In[18]:


a,b = map(int, input().split())


# In[19]:


if a*b <= 0:
    print("Zero")
elif a > 0 and b > 0:
    print("Positive")
else:
    if (b-a)%2 == 1:
        print("Positive")
    else:
        print("Negative")


# In[ ]:

Submission status: Accepted

Solution code:
#import numpy as np
#import functools
#import operator
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as comb_with
#from itertools import permutations as perm


#N = int(input())
a,b= map(int,input().split())
#A = list(map(int,input().split()))
#B = list(map(int,input().split()))
#S= str(input())
#prod = functools.partial(functools.reduce, operator.mul)
#c=np.array(A)
#p=np.prod(A)

if a<0:
    if 0<=b:
        print('Zero')

    else:
        if abs(a-b)%2==0:
            print('Negative')
        else:
            print('Positive')
elif a==0:
    print('Zero')

else:
    print('Positive')

Submission status: Accepted

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

import sys
import numpy as np
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

A, B = map(int, readline().split())

if A <= 0 and B >= 0:
    print("Zero")
elif A > 0:
    print("Positive")
else:
    print("Positive") if (B - A + 1) % 2 == 0 else print("Negative")

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if A > 0:
    print("Positive")
elif A == 0:
    print("Zero")
elif B < 0:
    if (B-A)%2 == 0:
        print("Negative")
    else:
        print("Positive")
else:
    print("Zero")

Submission status: Accepted

Solution code:
def resolve():
    a, b = list(map(int, input().split()))

    if a <= 0 and b >= 0:
        print('Zero')
    elif b < 0 and (b - a + 1) % 2 == 1:
        print('Negative')
    else:
        print('Positive')
    return


resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(a,b):
  if a <= 0 and b >= 0:
    return "Zero"
  elif a < b < 0 and (b-a+1) % 2 == 1:
    return "Negative"
  else:
    return "Positive"
    

a,b = map(int,input().split())
print(solve(a,b))

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2, log
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
from decimal import *

a, b = MAP()

if a*b <= 0:
	print("Zero")
elif (b-a+1)%2 and b < 0:
	print("Negative")
else:
	print("Positive")

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees#, log2, log
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7
from decimal import *

a, b = MAP()

if a*b <= 0:
	print("Zero")
elif (b-a+1)%2 and b < 0 and a < 0:
	print("Negative")
else:
	print("Positive")

Submission status: Accepted

Solution code:
a,b =map(int,input().split())
cnt =b-a+1

if a <0 and b>0 or a==0 or b==0:
    ans = "Zero"
elif (a>0 and b>0) or(a<0 and b<0 and cnt%2==0) :
    ans="Positive"
    
elif(a<0 and b<0 and cnt%2!=0):
    ans="Negative"
    
print(ans)

Submission status: Accepted

Solution code:
#AGC002-A
a,b = map(int,input().split())
if a > 0:
    print('Positive')
elif a <= 0 and b >= 0:
    print('Zero')
else:
    if (b - a + 1) % 2 == 0:
        print('Positive')
    else:
        print('Negative')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a<0 and b<0:
  if (b-a)%2!=0:
    print("Positive")
  else:
    print("Negative")
elif a<=0 and b>=0:
  print("Zero")
else:
  print("Positive")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())

if a>0 and b>0:
  print("Positive")
elif a<=0 and b>=0:
  print("Zero")
elif a<0 and b<0:
  if abs(a-b)%2:
    print("Positive")
  else:
    print("Negative")

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]

######OUTPUT######
def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()

#####Shorten#####
def DD(arg): return defaultdict(arg)


#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr

#####MakeDivisors######
def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors

#####MakePrimes######
def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum

#####GCD#####
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count

#####ChangeBase#####
def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

#####IntLog#####
def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count

#############
# Main Code #
#############
A,B = IL()

if A<=0<=B:
  print("Zero")
  exit()
if 0<A:
  print("Positive")
  exit()
if (B-A)%2==0:
  print("Negative")
else:
  print("Positive")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import defaultdict, deque
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline()[:-1]


def solve():
    a, b = [int(x) for x in input().split()]
    if a <= 0 and b >= 0:
        print("Zero")
    elif a > 0 and b > 0 or (b - a) % 2:
        print("Positive")
    else:
        print("Negative")

t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()



"""

1 4
7
RRRR
1 1 0 1
----
4

1 4
47
RCRR
1 1 0 1
----
-1

2 2
10
RR
RR
1 7
4 1
----
4

2 2
10
RR
RR
7 4
7 4
----
-1

3 3
8
RCR
RRC
RRR
1 1 1
1 1 1
1 3 1


3 3
1
RCR
RRC
RRR
1 1 1
1 1 1
1 3 1


"""

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a<=0<=b:
    print('Zero')
elif a<0 and b<0:
    n=abs(a-b)+1
    if n%2==0:
        print('Positive')
    else:
        print('Negative')
else:
    print('Positive')

Submission status: Accepted

Solution code:
import math
from collections import deque
from collections import defaultdict

import bisect

#自作関数群
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):#階乗
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):#コンビネーション
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def combmod(n,r,mod):
	return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
	r=copyQueue(q)
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): # root
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): # much time
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1
def maxValue(a,b,v):
	v2 = v
	for i in range(v2,-1,-1):
		for j in range(v2//a+1): #j:aの個数
			k = i-a*j
			if k%b==0:
				return i
	return -1
def copyQueue(q):
	nq = queue.Queue()
	n = q.qsize()
	for i in range(n):
		x = q.get()
		q.put(x)
		nq.put(x)
	return nq
def get_sieve_of_eratosthenes(n):
	#data = [2]
	data = [0,0,0]
	for i in range(3,n+1,2):
		data.append(i)
		data.append(0)
	for i in range(len(data)):
		interval = data[i]
		if interval!=0:
			for j in range(i+interval,n-1,interval):
				data[j] = 0
	#ans = [x for x in data if x!=0]
	ans = data[:]
	return ans

a,b = readInts()

if a<=0 and b>=0:
	print("Zero")
elif a<0 and (a-b)%2==0:
	print("Negative")
else:
	print("Positive")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if b < 0:
    print("Positive" if (b - a + 1) % 2 == 0 else "Negative")
elif a <= 0 and b >= 0:
    print("Zero")
else:
    print("Positive")

Submission status: Accepted

Solution code:
a, b = map(int, input().split());

if a * b <= 0 : 
  print('Zero')
  exit(0)

if a > 0 and b > 0 :
  print('Positive')
  exit(0)

x = b - a + 1
if(x%2 == 0) : 
  print('Positive')
else :
  print('Negative')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a <= 0 and b >= 0:
    ans = "Zero"
elif a > 0:
    ans = "Positive"
else:
    if (b-a)%2:
        ans = "Positive"
    else:
        ans = "Negative"
print(ans)

Submission status: Accepted

Solution code:
a, b = [int(i) for i in input().split()]

if a > 0:
    print("Positive")
elif a == 0:
    print("Zero")
else:
    if b >= 0:
        print("Zero")
    else:
        if (b - a) % 2 == 0:
            print("Negative")
        else:
            print("Positive")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())

if a<0 and b<0:
    aa=a%2
    bb=b%2

    if (aa+bb)%2==1:
        print("Positive")
    else:
        print("Negative")
    exit()

if a<=0 and 0<=b:
    print("Zero")
    exit()

if 0<a and 0<b:
    print("Positive")
    exit()

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a > 0:
    print('Positive')
elif a * b <= 0:
    print('Zero')
elif b < 0:
    if (b - a) % 2 == 0:
        print('Negative')
    else:
        print('Positive')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a*b<=0:
  print("Zero")
elif a>0 or a==b:
  print("Positive")
else:
  if abs(a-b) % 2 == 0:
    print("Negative")
  else:
    print("Positive")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a > 0:
    print('Positive')
elif b > 0:
    print('Zero')
elif (b-a+1)%2 == 0:
    print('Positive')
else:
    print('Negative')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a * b <= 0:
    print('Zero')
elif a > 0 or (a < 0 and (b - a) % 2 == 1):
    print('Positive')
else:
    print('Negative')

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if b < 0:
    print('Positive') if (b-a)%2 == 1 else print('Negative')
elif 0 < a:
    print('Positive')
else:
    print('Zero')

Submission status: Accepted

Solution code:
a , b = map(int, input().split())

if a*b<=0:
    print('Zero')
elif a>0:
    print('Positive')
elif abs(a-b)%2==0:
    print('Negative')
else:
    print('Positive')

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a<=0 and b>=0:
    print("Zero")
else:
    if a>0 and b>0:
        print("Positive")
    else:
        if (b-a+1)%2==0:
            print("Positive")
        else:
            print("Negative")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

# 0を挟む場合
if a <= 0 and 0 <= b:
    print("Zero")
# 両方プラスの場合
elif a > 0:
    print("Positive")
else:
    if (b + a + 1) % 2 == 0:
        print("Positive")
    else:
        print("Negative")

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    A, B = [int(x) for x in input().split()]

    if A >= 1:
        print("Positive")
    elif A * B <= 0:
        print("Zero")
    else:
        if (abs(B) - abs(A) + 1) % 2 == 1:
            print("Negative")
        else:
            print("Positive")

    

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin
a, b= [int(_) for _ in stdin.readline().rstrip().split()]
if a > 0:
    print("Positive")
elif a <= 0 and b >= 0:
    print("Zero")
elif (b - a) % 2:
    print("Positive")
else:
    print("Negative")

Submission status: Accepted

Solution code:
def main():
    a, b = map(int, input().split())
    if a > 0:
        print('Positive')
    elif a <= 0 and b >= 0:
        print('Zero')
    else:
        cnt = b - a + 1
        if cnt%2 == 0:
            print('Positive')
        else:
            print('Negative')

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b = map(int, input().split())
if a < 0:
    if b >= 0:
        print("Zero")
    else:
        if (a+b)%2:
            print("Positive")
        else:
            print("Negative")
elif a == 0:
    print("Zero")
else:
    print("Positive")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a>0 and b>0:
    print("Positive")
elif a<=0 and b>=0:
    print("Zero")
elif (abs(b-a)+1)%2==0:
    print("Positive")
elif (abs(b-a)+1)%2==1:
    print("Negative")

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

    if b < 0:
        if (b - a) % 2 == 0:
            ans = "Negative"
        else:
            ans = "Positive"
    elif a <= 0 <= b:
        ans = "Zero"
    else:
        ans = "Positive"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a*b <= 0:
  print("Zero")
elif a > 0:
  print("Positive")
else:
  if(b-a)%2 == 0:
    print("Negative")
  else:
    print("Positive")

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
if a>0 and b>0:
    print('Positive')
elif  a<0 and b<0 and (abs(a)-abs(b)+1)%2 != 0:
    print('Negative')
elif a<0 and b<0 and (abs(a)-abs(b)+1)%2==0:
    print('Positive')
else:
    print('Zero')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if a*b <= 0:
  print("Zero")
elif a > 0:
  print("Positive")
else:
  if(b-a)%2 == 0:
    print("Negative")
  else:
    print("Positive")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a * b <= 0:
    print('Zero')
elif a > 0:
    print('Positive')
else:
    if abs(a - b) % 2 == 0:
        print('Negative')
    else:
        print('Positive')

Submission status: Accepted

Solution code:
N = tuple([int(j) for  j in input().split(' ')])

#0が含まれたら０
if N[0] <= 0 and N[1] >= 0:
    print("Zero")
elif N[0] < 0 and N[1] < 0:
    if (N[0] * - 1 - N[1] * - 1) % 2  == 0:
        print("Negative")
    else:
        print("Positive")
elif N[0] > 0 and N[1] > 0:
    print("Positive")

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
if a > 0:
  print('Positive')
elif b >= 0:
  print('Zero')
else:
  if (b-a)%2 == 0:
    print('Negative')
  else:
    print('Positive')

Submission status: Accepted

Solution code:
a,b = map(int,input().split())

if (a < 0 and b > 0) or a == 0 or b == 0:
	print("Zero")
elif a > 0:
	print("Positive")
elif b < 0:
	if (b - a + 1) % 2 == 0:
		print("Positive")
	else:
		print("Negative")

Submission status: Accepted

Solution code:
a, b=map(int, input().split())
if a*b<=0:
  print("Zero")
elif a>0:
  print("Positive")
else:
  if (b-a+1)%2==0:
    print("Positive")
  else:
    print("Negative")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b = list(map(int, input().split()))
if a <= 0 <= b:  ### a と b の間に0を含む時
    print("Zero")
elif 0 < a <= b: ### a と b が正の場合
    print("Positive")
elif a <= b < 0: ### a と b が負の場合
    ### a と b の間に数字が偶数個なら正、奇数個なら負
    if (b - a + 1) % 2 == 0:
        print("Positive")
    else:
        print("Negative")

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a * b <= 0:
    print("Zero")
elif a > 0:
    print("Positive")
else:
    num = b - a + 1
    if num % 2 == 0:
        print("Positive")
    else:
        print("Negative")