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 .

Solution (Python):

import re
import math
from collections import defaultdict
import itertools
from copy import deepcopy
import random
from heapq import heappop,heappush
import time
import os
import queue
import sys
import datetime
from functools import lru_cache

readline=sys.stdin.readline
sys.setrecursionlimit(2000000)

alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_power(a,b):
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def get_facs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=""):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
def floor_(n,x=1):
    return x*(n//x)
def ceil_(n,x=1):
    return x*((n+x-1)//x)
def hani(x,min_,max_):
    ret=x
    if x<min_:ret=min_
    if x>max_:ret=max_
    return ret
def seifu(x):
    return x//abs(x)

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

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

Solution (Python):
a,b=map(int,input().split())
if a<=b<0:
  print('Negative' if (-1)**(a-b-1)==-1 else 'Positive')
elif a<=0<=b:
  print('Zero')
else:
  print('Positive')

Solution (Python):
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")

Solution (Python):
a, b = map(int, input().split())
if a<= 0 <=b:
    print("Zero")

elif a > 0:
    print("Positive")

else:
    b = min(b,1)
    a *= -1
    print("Positive" if (a-b)%2 == 1 else "Negative")

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

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

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

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

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

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

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

elif a > 0:
    print("Positive")

elif (b-a+1) % 2 == 0:
    print("Positive")

else:
    print("Negative")

Solution (Python):
import sys




a, b = list(map(int,sys.stdin.readline().rstrip().split()))

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

Solution (Python):
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())



a, b = list(map(int,sys.stdin.readline().rstrip().split()))

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys



a, b = list(map(int,sys.stdin.readline().rstrip().split()))

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())



a, b = list(map(int,sys.stdin.readline().rstrip().split()))

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

Solution (Python):
import sys



a, b = list(map(int,sys.stdin.readline().rstrip().split()))

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

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

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())



a, b = LI()

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

Solution (Python):
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')

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

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

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

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

Solution (Python):
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")

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

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

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

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

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

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

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

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

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

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

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


if __name__ == "__main__":
    main()

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

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

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



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

elif a==0 or b==0:
    print("Zero")

elif a>0:
    print("Positive")

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
def main():
    a, b = map( int, input().split())
    if a > 0:
        print("Positive")
        return
    if a <= 0 and b >= 0:
        print("Zero")
        return
    if (b-a+1)%2 == 0:
        print("Positive")
    else:
        print("Negative")
if __name__ == '__main__':
    main()

Solution (Python):
from statistics import median


from fractions import gcd
from itertools import combinations 
from collections import deque
from collections import defaultdict
import bisect










import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    a,b = readInts()
    judge = 0
    if a <= 0 <= b:
        pass
    elif a <= b < 0:
        if (abs(a) - abs(b) + 1)%2:
            judge = 2
        else:
            judge = 1
    else:
        judge = 1

    if judge == 0:
        print('Zero')
    elif judge == 1:
        print('Positive')
    else:
        print('Negative')
if __name__ == '__main__':
  main()

Solution (Python):
import sys

def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))

def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]

def to_bin(x: int) -> str: return format(x, 'b') 
def to_oct(x: int) -> str: return format(x, 'o') 
def to_hex(x: int) -> str: return format(x, 'x') 
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i):
            is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]

from itertools import accumulate as acc
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left


def main():
    a, b = MII()
    if a <= 0 and 0 <= b :
        print('Zero')
        return None
    if a > 0:
        print('Positive')
        return None
    if b < 0:
        neg = a - b + 1
        if neg%2 == 0:
            print('Positive')
        else:
            print('Negative')

if __name__ == '__main__':
    main()

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

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

Solution (Python):
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')

Solution (Python):
a,b=map(int,input().split())
if ( a<0 and b>0 ) or ( a>0 and b<0 ) or a==0 or b==0:
	print('Zero')
else:
	if a>0 and b>0:
		print('Positive')
	else:
		c=b-a
		print('Positive' if c&1 else 'Negative')

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

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

Solution (Python):


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

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

Solution (Python):
import numpy as np
import sys

input = sys.stdin.readline

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


cnt = b - a +1

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

Solution (Python):
import sys
input = sys.stdin.buffer.readline
a,b=map(int,input().split())
if a>0:
    print("Positive")
    exit(0)
elif a<=0 and 0<=b:
    print("Zero")
    exit(0)
elif a<0 and b<0:
    num=b-a+1
    if num%2==0:
        print("Positive")
        exit(0)
    else:
        print("Negative")
        exit(0)

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

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

if a<=0 and 0<=b:
  print("Zero")
  
elif a>0 and b>0:
  print("Positive")

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

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

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

Solution (Python):

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

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

Solution (Python):
from statistics import median


from fractions import gcd
from itertools import combinations 
from collections import deque
from collections import defaultdict
import bisect










import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    a,b = readInts()
    if a <= 0 and 0 <= b:
        print("Zero")
        exit()
    if 1 <= a <= b:
        print("Positive")
    else:
        if (abs(b-a)+1)%2 == 0:
            print("Positive")
        else:
            print("Negative")

if __name__ == '__main__':
  main()

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

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

print(ans)

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

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

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

print(ans)

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

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

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

Solution (Python):

a, b = [int(s) for s in input().split()]

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

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

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

Solution (Python):

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

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

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

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

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

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

print("Positive")

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
MOD = 10**9+7

def main():
    a, b = map(int, readline().split())
    l = b-a+1
    if a<=0 and 0<=b:
        ans = 'Zero'
    else:
        if l%2==0 or 0<a:
            ans = 'Positive'
        else:
            ans = 'Negative'
    print(ans)


if __name__ == '__main__':
    main()

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

Solution (Python):
line = input().split(" ")
a = int(line[0])
b = int(line[1])

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

Solution (Python):
x,y = map(int,input().split())

if x <=0 and 0 <= y:
    print('Zero')
elif 0 < x:
    print('Positive')
elif y < 0:
    if (x-y+1)%2==0:
        print('Positive')
    else:
        print('Negative')

Solution (Python):
import numpy as np
a,b = map(int,input().split(' '))
if np.sign(a)==1 and np.sign(b) == 1:
    print('Positive')
elif np.sign(a) == -1 and np.sign(b) == 1:
    print('Zero')
elif np.sign(a) == -1 and np.sign(b) == -1:
    if (b - a + 1) % 2 == 0:
        print('Positive')
    else:
        print('Negative')

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

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

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

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

Solution (Python):
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")

Solution (Python):
def main():
    a, b = (int(i) for i in input().split())
    if a*b <= 0:
        print("Zero")
    elif 0 < a:
        print("Positive")
    else:
        if (b-a+1) % 2 == 0:
            print("Positive")
        else:
            print("Negative")


if __name__ == '__main__':
    main()

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Solution (Python):
a, b = map(int, 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")

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

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

Solution (Python):
i = input().split()
a = int(i[0])
b = int(i[1])
if a < 0 and b > 0:
	print("Zero")  
elif a < 0 and b < 0:
	tmp = (a*-1) - (b*-1) + 1
	if tmp % 2 == 0:
		print("Positive")
	else:
		print("Negative")
else:
	print("Positive")

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

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

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

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

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

Solution (Python):



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


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

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

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

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

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

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

Solution (Python):
A,B=map(int,input().split())
count=0
if A==0 or B==0:
	print("Zero")
	exit()
else:
	if A<0 and B>0:
		print("Zero")
	elif A>0:
		print("Positive")
	elif A<0 and B<0:
		if (abs(B)-abs(A))%2==0:
			print("Negative")
		else:
			print("Positive")