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")
elif a > 0:
    print("Positive")
else:
    if (b-a)%2 == 0:
        print("Negative")
    else:
        print("Positive")

Submission status: Accepted

Solution code:
# from math import factorial,sqrt,ceil,gcd
# from itertools import permutations as permus
# from collections import deque,Counter
# import re
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# from scipy.sparse.csgraph import shortest_path, dijkstra, floyd_warshall, bellman_ford, johnson
# from scipy.sparse import csr_matrix

# slist = "abcdefghijklmnopqrstuvwxyz"
a,b = map(int,input().split())

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

print(ans)
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する
# print("{:.10f}".format(ans))
# print("{:0=10d}".format(ans))

Submission status: Accepted

Solution code:
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 = map(int, input().split())
print(solve(a, b))

Submission status: Accepted

Solution code:
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 = map(int, input().split())
print(solve(a, b))

Submission status: Accepted

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

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==1):
    print("Positive")
  else:
    print("Negative")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

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

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

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


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

Submission status: Accepted

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

if a > 0 and b > 0:
  print("Positive")

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

  else:
    print("Negative")

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

Submission status: Accepted

Solution code:
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 and 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 > 0 and b > 0:
    print('Positive')
elif a < 0 and b < 0:
    if ((a - b) + 1) % 2 == 0:
        print('Positive')
    else:
        print('Negative')
else:
    print('Zero')

Submission status: Accepted

Solution code:
def myAnswer(a:int,b:int) -> str:
   # ゼロがまたがっている場合はzero ex)-1 2
   if(a <= 0 and b >= 0): return "Zero"
   
   if(a < 0):# aが負の数で
      if(b < 0): # bも負の数だった場合は,負の数の個数をカウントし、奇数ならNegative,偶数ならポジティブ
         return "Negative" if((abs(a-b) + 1)%2==1) else "Positive"
   else:
      return "Positive"


def modelAnswer():
   tmp=1
def main():
   a,b = map(int,input().split())
   print(myAnswer(a,b))

if __name__ == '__main__':
   main()

Submission status: Accepted

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


def modelAnswer():
   tmp=1
def main():
   a,b = map(int,input().split())
   print(myAnswer(a,b))

if __name__ == '__main__':
   main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 5 + 10)


def input(): return sys.stdin.readline().strip()


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





resolve()

Submission status: Accepted

Solution code:
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math

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

Submission status: Accepted

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

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

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

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

# < 0
print("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:
    if (b-a+1)%2:print('Negative')
    else:print('Positive')

Submission status: Accepted

Solution code:
from bisect import bisect_right
a, b = (int(x) for x in input().split())
if a <= 0 and 0 <= b: #0を含む
  print('Zero')
elif 0 < a and 0 < b: #すべて正
  print('Positive')
else: #すべて負
  print('Positive' if (b - a + 1)%2 == 0 else 'Negative')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a, b = map(int,input().split())

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
if a > 0 and b > 0:
    ans = 'Positive'
elif a == 0 or b == 0:
    ans = 'Zero'
elif a < 0 and 0 < b:
    ans = 'Zero'
else:
    if (b - a) % 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 or b == 0:
    print("Zero")
elif a < 0 and b > 0:
    print("Zero")
elif a < 0 and b < 0:
    tmp = abs(a-b)
    if tmp % 2 == 0:
        print("Negative")
    else:
        print("Positive")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a > b:
    a, b = b, a

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

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
if n > 0:
  print('Positive')
elif n * m <= 0:
  print('Zero')
elif (m - n) % 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")
elif a>0:print("Positive")
elif (b-a)%2==0:print("Negative")
else:print("Positive")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from fractions import gcd
from math import factorial, sqrt
from functools import lru_cache, reduce
INF = 1 << 60
mod = 1000000007
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

# UnionFind
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        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 -self.parents[self.find(x)]

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

    def members(self, x):
        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()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

# ダイクストラ
def dijkstra_heap(s, edge, n):
    #始点sから各頂点への最短距離
    d = [10**20] * n
    used = [True] * n #True:未確定
    d[s] = 0
    used[s] = False
    edgelist = []
    for a,b in edge[s]:
        heapq.heappush(edgelist,a*(10**6)+b)
    while len(edgelist):
        minedge = heapq.heappop(edgelist)
        #まだ使われてない頂点の中から最小の距離のものを探す
        if not used[minedge%(10**6)]:
            continue
        v = minedge%(10**6)
        d[v] = minedge//(10**6)
        used[v] = False
        for e in edge[v]:
            if used[e[1]]:
                heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
    return d

# 素因数分解
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

# 2数の最小公倍数
def lcm(x, y):
    return (x * y) // gcd(x, y)

# リストの要素の最小公倍数
def lcm_list(numbers):
    return reduce(lcm, numbers, 1)

# リストの要素の最大公約数
def gcd_list(numbers):
    return reduce(gcd, numbers)

# ここから書き始める
a, b = 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")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = list(map(int,input().split()))
ans = 0
if N [0] < 0 and N[1] > 0:
    ans = "Zero"
elif N[0] < 0:
    if (N[1] - N [0]) % 2 == 0:
        ans = "Negative"
    else:
        ans = "Positive"
elif N[0] > 0:
    ans = "Positive"
else:
    ans = "Zero"

print(ans)

Submission status: Accepted

Solution code:
#coding:utf-8
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 and (b-a+1) % 2 == 0:
    print('Positive')
else:
    print('Negative')

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

a,b = iim()

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:
m=input().strip("\n").split(" ")
a,b=int(m[0]),int(m[1])
if a>0:
    print("Positive")
elif b<0:
    if (b-a)%2:
        print("Positive")
    else:
        print("Negative")
else:
    print("Zero")

Submission status: Accepted

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

if a > 0:
    print("Positive")
elif a <= 0 <= b:
    print("Zero")
# 全部負の場合
else:
    if abs(a - b) % 2 == 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, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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

a, b = MAP()

if a <= 0 <= b:
	print("Zero")
elif b < 0:
	print("Positive" if (b-a+1)%2 == 0 else "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 (b-a)%2:
    print('Positive')
else:
    print('Negative')

Submission status: Accepted

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

if numpy.sign(a*b)==-1:
  print('Zero')
elif (numpy.sign(a)==1) or (numpy.sign(b)==1):
  print('Positive')
elif (a-b)%2==0:
  print('Negative')
else:
  print('Positive')

Submission status: Accepted

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

if a%2==0 and b%2==1 or a%2==1 and b%2==0:
  num=1
  
if a>0 and b>0 or a<0 and b<0 and num==1:
  print("Positive")
  
elif a<0 and b<0 and num==0 or a<0 and b<0:
  print("Negative")
  
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))and((abs(a)+abs(b))%2==0):
    print('Negative')
elif (a>0)and(b>0):
    print('Positive')
elif ((a<0)and(b<0))and((abs(a)+abs(b))%2==1):
    print('Positive')
elif (a==0)or(b==0):
    print('Zero')
else:
    print('Zero')

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

elif a > 0:
    print('Positive')

elif (a-b) % 2 == 0:
    print('Negative')

elif (a-b) % 2 == 1:
    print('Positive')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#template
from collections import Counter
def inputlist(): return [int(j) for j in input().split()]
#template
a,b = inputlist()
if a*b <= 0:
    print("Zero")
    exit()
if a > 0 and b > 0:
    print("Positive")
    exit()
if a < 0 and b < 0:
    d = abs(a) - abs(b) + 1
    if d % 2 == 0:
        print("Positive")
    if d % 2 == 1:
        print("Negative")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if a>0:
    print('Positive')
elif a<0 and b>0 or a==0 or 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 or b==0:
  ans="Zero"
elif a>0:
  ans="Positive"
else:
  if b>0:
    ans="Zero"
  else:
    c=b-a+1
    if c%2==0:
      ans="Positive"
    else:
      ans="Negative"

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

Submission status: Accepted

Solution code:
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from decimal import *
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
INF = float('inf') #無限大
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(sys.stdin.readline()) #整数読み込み
def ifn(): return float(sys.stdin.readline()) #浮動小数点読み込み
def isn(): return sys.stdin.readline().split() #文字列読み込み
def imn(): return map(int, sys.stdin.readline().split()) #整数map取得
def imnn(): return map(lambda x:int(x)-1, sys.stdin.readline().split()) #整数-1map取得
def fmn(): return map(float, sys.stdin.readline().split()) #浮動小数点map取得
def iln(): return list(map(int, sys.stdin.readline().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, sys.stdin.readline().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD
def print_list(l): print(*l, sep='\n')

def sieves_of_e(n):
    is_prime = [True] * (n+1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i * 2, n+1, i): is_prime[j] = False
    return is_prime

a,b = imn()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main(a, b):
    if 0 < a <= b:
        print("Positive")
        return

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

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


if __name__ == "__main__":
    a, b = map(int, input().split())
    main(a, b)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

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 (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 and b > 0:
    print("Positive")
else:
    if (min(0,b)-a)%2 == 1:
        print("Positive")
    else:
        print("Negative")

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 and b < 0 :
  if abs(a - b +1) % 2 == 0:
    print('Positive')
  else:
    print('Negative')
else:
  print('Positive')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")
    elif (b - a) % 2 == 1: 
        print("Positive")

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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("Positive")
        else:
            print("Negative")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

sys.setrecursionlimit(10**6)

if __name__ == '__main__':
    examA()

"""

"""

Submission status: Accepted

Solution code:
a, b=map(int, input().split())
if a==0 or b==0:
  print("Zero")
  exit()
if(a<=0 and b>=0):
  print("Zero")
  exit()
if a>0:
  print("Positive")
elif abs(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("Zero")
if a>0:print("Positive")
if b<0:print("Positive" if (b-a)%2 else "Negative")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
# input = sys.stdin.readline
def INT(): return int(input())
def MAP(): return map(int,input().split())
def LI(): return list(map(int,input().split()))

def main():
    a,b = MAP()
    if a<=0 and b>=0:
        print('Zero')
        return
    if a>0: #全部正の場合
        print('Positive')
        return
    
    if b<0: #全部ふの場合
        if (b-a+1)%2 == 0:
            print('Positive')
        else:
            print('Negative')
    

    return

if __name__ == '__main__':
    main()

Submission status: Accepted

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

if a <= 0 <= b:
    ans = "Zero"
elif a <= b < 0:
    cnt = b - a + 1
    ans = "Negative" if cnt % 2 else "Positive"
else:
    ans = "Positive"

print(ans)

Submission status: Accepted

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