CodeEff/ECCO huggingface dataset:
# Original solution
import sys
a,b = list(map(int,input().split()))
if a > 0:
    print('Positive')
    sys.exit()
if b >= 0:
    print('Zero')
    sys.exit()
minus_count = 0
for i in range(a,b+1):
    if i < 0:
        minus_count += 1
if minus_count%2 == 1:
    print('Negative')
else:
    print('Positive')

# Optimized solution
import sys
a,b = list(map(int,input().split()))
if a > 0:
    print('Positive')
    sys.exit()
if b >= 0:
    print('Zero')
    sys.exit()
if (b-a+1)%2 == 1:
    print('Negative')
else:
    print('Positive')
# Original solution
a,b=list(map(int,input().split()))
aa=[a,b]
for i in range(a,b):
  if not i in aa:
    aa.append(i)
z=aa.count(0)
n=sum([1 for i in aa if i<0])%2
if z>0:
  print('Zero')
elif n==0:
  print("Positive")
else:
  print("Negative")

# Optimized solution
a,b=list(map(int,input().split()))
a=min(1,a)
b=min(1,b)
if b==1 and a<=0:
  print('Zero')
elif b==0:
  print('Zero')
elif (b-a)%2==0 and b<0:
  print("Negative")
else:
  print("Positive")
# Original solution
a,b = list(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)

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

n = 0
for i in range(a, b+1):
  if i < 0:
    n += 1
  elif i == 0:
    print('Zero')
    exit()

if n%2 == 1:
  print('Negative')
else:
  print('Positive')

# Optimized solution
a, b = list(map(int, input().split()))

if a > 0 and b > 0:
  print('Positive')
elif a < 0 and b < 0:
  if (b-a+1)%2 == 0:
    print('Positive')
  else:
    print('Negative')
else:
  print('Zero')
# Original solution
a, b = list(map(int, input().split()))
c = 1
for i in range(a, b+1):
    c *= i
if c==0:
    print("Zero")
elif c>0:
    print("Positive")
else:
    print("Negative")

# Optimized solution
a, b = list(map(int, input().split()))
if a>0 and b>0:
    print("Positive")
elif a==0 or b==0:
    print("Zero")
elif (a>0 and b<0) or (a<0 and b>0):
    print("Zero")
elif ((a+b)+1)%2==0:
    print("Positive")
else:
    print("Negative")
# Original solution
a=input().split()
a[0]=int(a[0])
a[1]=int(a[1])
if(a[0]<=0 and a[1]>=0):
    print("Zero")
elif(a[0]<0 and a[1]<0 and (a[1]-a[0])%2==0):
    print("Negative")
else:
    print("Positive")

# Optimized solution
a,b=[int(x) for x in input().split()]
if a*b<=0:
    print('Zero')
elif a>0 or (b-a+1)%2==0:
    print('Positive')
else:
    print('Negative')
# Original solution
# AGC 002: A – Range Product
a, b = [int(s) for s in input().split()]
c = [k for k in range(a, b + 1)]

if 0 in c:
    print('Zero')
elif len([k for k in c if k < 0]) % 2 == 0:
    print('Positive')
else:
    print('Negative')

# Optimized solution
# AGC 002: A – Range Product
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')
# Original solution
a, b = list(map(int, input().split()))
p = 1

for i in range(a, b+1):
    p *= i
if p > 0:
    print("Positive")
elif p < 0:
    print("Negative")
else:
    print("Zero")

# Optimized solution
a, b = list(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")
# Original solution
a, b = input().split()
a, b = int(a), int(b)

n = 1
for i in range(a, b + 1):
    n *= i

if n > 0:
    print("Positive")
elif n < 0:
    print("Negative")
else:
    print("Zero")


# Optimized solution
a, b = input().split()
a, b = int(a), int(b)

if a < 0 < b:
    print("Zero")
elif 0 < a < b:
    print("Positive")
elif a < b < 0:
    if (b - a + 1) % 2 == 0:
        print("Positive")
    else:
        print("Negative")
# Original solution
a, b = list(map(int, input().split()))
nega_cnt = 0
is_zero = False
for x in range(a, b+1):
        if x < 0:
                nega_cnt += 1

        elif x == 0:
                print("Zero")
                is_zero = True

if not is_zero:

        if nega_cnt % 2 == 1:
                print("Negative")
        else:
                print("Positive")
                       

# Optimized solution
a, b = list(map(int, input().split()))
nega_cnt = 0
is_zero = False
if a * b < 0:
        print("Zero")
        is_zero = True
elif b < 0 and (a-b) % 2 == 0:
        print("Negative")
else:
        print("Positive")
# Original solution
def main():
    a, b = (int(i) for i in input().split())
    if a <= 0 and 0 <= b:
        print("Zero")
    elif a > 0:
        print("Positive")
    elif b < 0:
        if (b - a) % 2 == 0:
            print("Negative")
        else:
            print("Positive")
if __name__ == "__main__":
    main()

# Optimized solution
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()
# Original solution
def solve(a, b):
    if a < 0 and 0 < b:
        return 'Zero'
    if 0 < a:
        return 'Positive'
    length = b - a + 1
    return 'Positive' if length % 2 == 0 else 'Negative'


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


# Optimized solution
def solve(a, b):
    if a <= 0 and 0 <= b:
        return 'Zero'
    if 0 < a:
        return 'Positive'
    length = b - a + 1
    return 'Positive' if length % 2 == 0 else 'Negative'


a, b = list(map(int, input().split()))
print((solve(a, b)))
# Original solution
a, b = list(map(int, input().split()))
n = 1
L = []
for i in range(min(a, b), max(a, b)+1):
  n = n * i
if n == 0:
  print('Zero')
elif n > 0:
  print('Positive')
else:
  print('Negative')

# Optimized solution
a, b = list(map(int, input().split()))
n = 1
L = []
if a * b < 0:
  print('Zero')
elif a + b > 0 or (a - b) % 2 == 1:
  print('Positive')
else:
  print('Negative')
# Original solution
a, b = list(map(int, input().split()))
cnt = 1
for i in range(a, b+1):
    cnt *= i
if cnt < 0:
    print('Negative')
elif cnt == 0:
    print('Zero')
else:
    print('Positive')


# Optimized solution
a, b = list(map(int, input().split()))

if a <= 0 <= b:
    print('Zero')
elif 0 < a:
    print('Positive')
elif (b - a + 1)%2 == 0:
    print('Positive')
else:
    print('Negative')
# Original solution
import operator as o
import functools as f
a,b=list(map(int,input().split()))
c=f.reduce(o.mul,list(range(a,b+1)))
if c>0:
  print("Positive")
elif c<0:
  print("Negative")
else:
  print("Zero")

# Optimized solution
a,b=list(map(int,input().split()))

if a>0:
  print("Positive")
elif 0 in range(a,b+1):
  print("Zero")
else:
  if (b-a)%2==0:
    print("Negative")
  else:
    print("Positive")
# Original solution
# -*- coding: utf-8 -*-

# スペース区切りの整数の入力
a, b = list(map(int, input().split()))
list1=[]
d=b-a
for i in range(d+1):
    list1.append(a+i)
s=1
for i in list1:
    s=s*i
if s<0:
    print("Negative")
elif s==0:
    print("Zero")
else:
    print("Positive")

# Optimized solution
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b = list(map(int, input().split()))
dnum=b-a+1
if b<0:
    odd=0
    if dnum%2==1:
        odd=1
    if odd==0:
        print("Positive")
    else:
        print("Negative")
if a*b==0:
    print("Zero")
if b>0 and a<0:
    print("Zero")
if a>0:
    print("Positive")
# Original solution
a, b = list(map(int, input().split()))
neg_count = 0
for i in range(a, b+1) :
    if i < 0 :
        neg_count += 1
    elif i == 0 :
        neg_count = -1
        break
    else :
        continue

if neg_count == -1 :
    print("Zero")
elif neg_count % 2 == 0 :
    print("Positive")
else :
    print("Negative")


# Optimized solution
a, b = list(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")
# Original solution
a, b = list(map(int, input().split()))
minus = 0
for i in range(a, b + 1):
    if i == 0:
        print('Zero')
        break
    elif i < 0:
        minus += 1
else:
    if minus % 2:
        print('Negative')
    else:
        print('Positive')


# Optimized solution
a, b = list(map(int, input().split()))

if a * b <= 0:
    print('Zero')
elif 1 <= a:
    print('Positive')
else:
    if (b - a) %2 == 0:
        print('Negative')
    else:
        print('Positive')
# Original solution
a,b=list(map(int,input().split()))
l=list(range(a,b+1))
ans=1
for i in range(len(l)):
  ans=ans*l[i]
if ans>0:
  print("Positive")
elif ans<0:
  print("Negative")
else:
  print("Zero")

# Optimized solution
a,b=list(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")
elif (a<0 and b<0 and (a+b)%2==0):
	print("Negative")
else:
	print("Positive")
# Original solution
a, b = list(map(int, input().split()))
s = 1
for i in range(a, b+1):
  s *= i
print(("Positive" if s > 0 else "Negative" if s < 0 else "Zero"))

# Optimized solution
a, b = list(map(int, input().split()))
if a <= 0 <= b:
  print("Zero")
elif a > 0:
  print("Positive")
else:
  if (b - a + 1) % 2 == 0:
    print("Positive")
  else:
    print("Negative")
# Original solution
a, b = list(map(int, input().split()))

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

# Optimized solution
import sys
a,b = list(map(int, input().split()))

if a<=0 and b>= 0:
  print("Zero")
  sys.exit()
elif a < 0 and b < 0:
  if (-(a-b)+1)%2 == 0:
    print("Positive")
    sys.exit()
  else:
    print("Negative")
    sys.exit()
elif a==0 or b==0:
  print("Zero")
  sys.exit()
elif a>0 and b>0:
  print("Positive")
  sys.exit()
else:
  if (-a)%2 == 0:
    print("Positive")
  else:
    print("Negative")
# Original solution
import sys

def main():
    l = input().split()
    a = int(l[0])
    b = int(l[1])

    temp = 1
    for i in range(a, b+1):
        temp *= i
    else:
        if temp == 0:
            print("Zero")
        elif temp > 0:
            print("Positive")
        else:
            print("Negative")


if __name__ == '__main__':
    main()


# Optimized solution
import sys

def main():
    l = input().split()
    a = int(l[0])
    b = int(l[1])

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

if __name__ == '__main__':
    main()
# Original solution
a,b=list(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"))

# Optimized solution
a,b=list(map(int,input().split()))
if 0<a:
    print("Positive")
elif a<=0<=b:
    print("Zero")
else:
    print(("Positive" if (b-a)%2 else "Negative"))
# Original solution
a, b = list(map(int, input().split()))
ans = 1
for i in range(a, b+1):
  ans *= i
if ans < 0:
  print("Negative")
elif ans > 0:
  print("Positive")
else:
  print("Zero")

# Optimized solution
a, b = list(map(int, input().split()))

if a<=0 and 0<=b:
  print("Zero")  
elif a < 0 and min(b-a,-a)%2 == 0:
  print("Negative")
else:
  print("Positive")
# Original solution
a,b = list(map(int,input().split()))

count = 1

for i in range(a,b+1):
    count *= i

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

# Optimized solution
a,b = list(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")
# Original solution
a, b = list(map(int, input().split()))
c = 1

if a <= 0 and b >= 0:
    print("Zero")
else:
    for i in range(b - a + 1):
        if a + i < 0:
            c *= -1
    if c == 1:
        print("Positive")
    else:
        print("Negative")

# Optimized solution
a, b = list(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")
# Original solution
a, b =list(map(int,input().split()))

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

# Optimized solution
import sys
def input():
    return sys.stdin.readline()[:-1]
def main():
    a, b = list(map(int,input().split()))
    if a > 0 and b > 0:
        print("Positive")
    elif a*b <= 0:
        print("Zero")
    else:
        if (b-a)%2 == 1:
            print("Positive")
        else:
            print("Negative")
if __name__ == '__main__':
    main()
# Original solution
a, b = list(map(int, input().split()))
p = 1
for i in range(a, b + 1):
    p *= i
if p > 0:
    print("Positive")
elif p == 0:
    print("Zero")
else:
    print("Negative")


# Optimized solution
a, b = list(map(int, input().split()))
res = "Positive"
if b < 0:
    if (b - a + 1) & 1:
        res = "Negative"
elif b >= 0:
    if a <= 0:
        res = "Zero"
print(res)
# Original solution
a,b=list(map(int,input().split()));print((("Zero","PNoesgia"[b<(b-a)%2<1::2]+"tive")[a*b>0]))

# Optimized solution
a,b=list(map(int,input().split()));print(("Zero"*(a*b<1)or "PNoesgia"[b<(b-a)%2<1::2]+"tive"))
# Original solution
a,b=list(map(int,input().split()))
if a<=0 and b>=0:
    print('Zero')
elif a>0 and b>0:
    print('Positive')
elif a<0 and b<0:
    N=1
    for i in range(a,b+1,1):
        N=N*i
    if N>0:
        print("Positive")
    else:
        print("Negative")


# Optimized solution
a,b=list(map(int,input().split()))
if a<=0 and b>=0:
    print('Zero')
elif a>0 and b>0:
    print('Positive')
elif a<0 and b<0:
    if ((-a)-(-b)+1)%2==0:
        print("Positive")
    else:
        print("Negative")
# Original solution
a,b=list(map(int,input().split()))
ne=[]
po=[]
for i in range(a,b+1):
    if i<0:
        ne.append(i)
    if i>0:
        po.append(i)
    if i==0:
        print("Zero")
        exit()
if len(po)==0:
    print(("Positive" if len(ne)%2==0 else "Negative"))
else:
    print("Positive")

# Optimized solution
a,b=list(map(int,input().split()))
if a>=0:
    print(("Positive" if a!=0 else "Zero"))
if a<0 and b>0:
    print("Zero")
if b<=0:
    if b==0:
        print("Zero")
    else:
        if (a-b+1)%2==0:
            print("Positive")
        else:
            print("Negative")
# Original solution
a, b = list(map(int, input().split()))

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


# Optimized solution
a, b = list(map(int, input().split()))

if (a <= 0 and 0 <= b):
  print("Zero")
elif (b < 0):
  if abs(a - b) % 2 == 0:
    print("Negative")
  else:
    print("Positive")
else:
  print("Positive")
# Original solution
a, b = list(map(int, input().split()))
lst = [i for i in range(a, b + 1)]

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

print(ans)

# Optimized solution
a, b = list(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)
# Original solution
a,b = list(map(int,input().split()))

ans = 1

for i in range(a,b+1):
  ans *= i
  
if ans > 0:
  print('Positive')
  
elif ans==0:
  print('Zero')
  
else:
  print('Negative')

# Optimized solution
a,b = list(map(int,input().split()))

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

elif a>0:
  print('Positive')

else:
  print('Zero')
# Original solution
A = list(map(int, input().split()))
A.sort()
a = A[0]
b = A[1]
ans = a

for i in range(1, b-a+1):
    ans *= a + i
    i += 1

if ans > 0:
    print("Positive")
elif ans < 0:
    print("Negative")
else:
    print("Zero")    


# Optimized solution
A = list(map(int, input().split()))
A.sort()
a = A[0]
b = A[1]
c = b-a

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

elif a > 0:
    print("Positive")

elif b < 0:
    if c%2 == 1:
        print("Positive")
    else:
        print("Negative")
# Original solution
a, b = list(map(int,input().split()))

f = [0] * 2
for i in range(a, b + 1):
    if i == 0:
        f[0] += 1
        break
    elif i < 0:
        f[1] += 1

if f[0] > 0:
    print("Zero")
elif f[1] % 2 == 1:
    print("Negative")
else:
    print("Positive")

# Optimized solution
a, b = list(map(int,input().split()))

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

if a > 0:
    print("Positive")
    exit()

if (b - a) % 2 == 0:
    print("Negative")
else:
    print("Positive")
# Original solution
a,b=list(map(int, input().split()))
ans=1
if a <= 0 and b >= 0:
  print('Zero')
  exit(0)
for i in range(a, b+1):
  ans = ans*i
if ans>0:
  print('Positive')
else:
  print('Negative')

# Optimized solution
a,b=list(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)
# Original solution
a, b = list(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')

# Optimized solution
import sys
#N = I()
#A = [LI() for _ in range(N)]

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')
# Original solution
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())
#N = I()
#A = [LI() for _ in range(N)]

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')

# Optimized solution
import sys

#N = I()
#A = [LI() for _ in range(N)]

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')
# Original solution
def slove():
    import sys
    input = sys.stdin.readline
    a, b = list(map(int, input().rstrip('\n').split()))
    if a * b > 0 :
        if a > 0 and b > 0:
            print("Positive")
        elif a < 0 and b < 0:
            print(("Positive" if abs(a - b + 1) % 2 == 0 else "Negative"))
        elif a < 0 and 0 < b:
            print(("Positive" if abs(a) % 2 == 0 else "Negative"))
    else:
        print("Zero")


if __name__ == '__main__':
    slove()


# Optimized solution
def slove():
    import sys
    input = sys.stdin.readline
    a, b = list(map(int, input().rstrip('\n').split()))
    if a * b <= 0:
        print("Zero")
    elif a > 0 and b > 0:
        print("Positive")
    else:
        if a * b >= 0:
            if abs(a - b + 1) % 2 == 0:
                print("Positive")
            else:
                print("Negative")
        else:
            if abs(a) % 2 == 0:
                print("Positive")
            else:
                print("Negative")


if __name__ == '__main__':
    slove()
# Original solution
a, b = list(map(int, input().split()))
if a > 0 and b > 0:
    print("Positive")
elif a == 0 or b == 0 or (a * b < 0):
    print("Zero")
elif a < 0 and b < 1:
    if (abs(a) - abs(b)) % 2 == 0:
        print("Negative")
    else:
        print("Positive")


# Optimized solution
a, b = list(map(int, input().split()))
if a < 0 and b < 0:
    if (abs(a) - abs(b)) % 2 == 0:
        print("Negative")
    else:
        print("Positive")
elif a > 0 and b > 0:
    print("Positive")
else:
    print("Zero")
# Original solution
a,b=list(map(int, input().split()))
s = 1
for i in range(a,b+1):
  s *= i
if s < 0:
  print("Negative")
elif s == 0:
  print("Zero")
else:print("Positive")

# Optimized solution
def a():return input()#s
def ai():return int(input())#a,n or k
def ma():return map(int, input().split())#a,b,c,d or n,k
def ms():return map(str, input().split())#,a,b,c,d
def lma():return list(map(int, input().split()))#x or y
def lms():return list(map(str, input().split()))#x or y
k= []
l = []
f = 0
def say(i):return print("Yes" if i == 0 else "No")
def Say(i):return print("YES" if i == 0 else "NO")

a,b = ma()
if a*b > 0 :
    if a+b >0:print("Positive")
    elif abs(b-a+1)%2==0:print("Positive")
    else:print("Negative")
else:print("Zero")
# Original solution
a, b = list(map(int, input().split()))

ans = 1
for i in range(a, b + 1):
    ans *= i

if ans > 0:
    print("Positive")
elif ans < 0:
    print("Negative")
elif ans == 0:
    print("Zero")
else:
    pass


# Optimized solution
a, b = list(map(int, input().split()))

if a > 0 and b > 0:
    print("Positive")
elif a < 0 and b > 0:
    print("Zero")
else:
    if (b - a + 1) % 2 == 0:
        print("Positive")
    else:
        print("Negative")
# Original solution
a, b = list(map(int, input().split()))
for i in range(a, b):
  a *= i
if a < 0 :
  print("Negative")
elif a == 0:
  print("Zero")
else:
  print("Positive")
  

# Optimized solution
a, b = list(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")
# Original solution
import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../Documents/input.txt'))
	#print(name)
	sys.stdin = open(name)

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

ans = 1

for i in range(a,b+1):
	#print(i)
	ans = i*ans

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


# Optimized solution
import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../Documents/input.txt'))
	#print(name)
	sys.stdin = open(name)

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

ans = 1

if a > 0 and b > 0:
	print("Positive")
elif a <= 0 and b >=0:
	print("Zero")
else:
	if (a-b)%2 == 0:
		print("Negative")
	else:
		print("Positive")
# Original solution
x,b = list(map(int,input().split()))
for i in range(x+1,b+1):
    x=x*i
if x>0:
    print("Positive")
elif x<0:
    print("Negative")
elif x==0:
    print("Zero")

# Optimized solution
a,b = list(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")
# Original solution
a,b = list(map(int,input().split()))

lis = [i for i in range(a,b+1)]

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

# Optimized solution
a,b = list(map(int,input().split()))

if a>0 and b>0:
  print("Positive")
  exit()
elif a<=0 and b>=0:
  print("Zero")
  exit()
elif a==0 or b==0:
  print("Zero")
elif a<0 and b<0:
  if (abs(a-b)+1)%2==0:
    print("Positive")
    exit()
  else:
    print("Negative")
    exit()
# Original solution
a, b = list(map(int, input().split()))
ans = 1

for i in range(a, b+1):
    ans *= i
if(ans != 0):
    print(("Positive" if ans > 0 else "Negative"))
else:
    print("Zero")

# Optimized solution
a, b = list(map(int, input().split()))

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