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++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <iomanip>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#define INF 100000000
#define MOD 1000000007
using namespace std;


int main(){
    long long a,b;
    cin>>a>>b;
    
    if(a<=0 && b>=0){
        cout<<"Zero"<<endl;
    }else if(a>=0 && b<=0){
        cout<<"Zero"<<endl;
    }else if(a==0 || b==0){
        cout<<"Zero"<<endl;
    }else if(a>0 && b>0){
        cout<<"Positive"<<endl;
    }else if(a<0 && b<0){
        
        long long num=abs(a-b)+1;
        if(num%2){
            cout<<"Negative"<<endl;
        }else{
            cout<<"Positive"<<endl;
        }
        
    }
    return 0;
}