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 in C++ (GCC 9.2.1) (judge verdict: Wrong Answer)

		#include <bits/stdc++.h>
		  #define endl "\n"
		  #define ll long long int
		  #define mod 1000000007
		  #define inf 1000000000000000001;
		  using namespace std;
		  int main()
		  {
		    //  #ifndef ONLINE_JUDGE
		    //  // for getting input from input.txt
		    //  freopen("input.txt", "r", stdin);
		    //  // for writing output to output.txt
		    //  freopen("output.txt", "w", stdout);
		    // #endif
		    std::ios::sync_with_stdio(false);
		    cin.tie(NULL);
			ll a,b;
			cin>>a>>b;
			if(a>0 && b>0){ cout<<"positive"; }
			else if(a <= 0 && b >= 0){ cout<<"zero"; }
			else if(a >= 0 && b <= 0){ cout<<"zero"; }
			else{
				if(abs(a-b)%2 != 0){
					cout<<"positive";
				}
				else{
					cout<<"negative";
				}
			}
		    return 0;
		  }